HeLp

0903A Consider a linked list status after some insert operation is like the picture below: root 90 next NULL prev 70 next prev 50 next prev Consider a node pointer 'c has already traversed a linked list and stopped at a node (For example 70 in the above picture). Now, you got an integer item 80 and you need to insert it after the node containing 70. Write a function tha takes a pointer to a node and inserts an item after that node. Assume that c is not null, however, the next pointer of can be null, For example, if c is pointing to node 90, then the item will be inserted after that. void insert_afterode' cur node, int item)