Suppose your program contains type definitions and pointer variable declarations as in Self-Test Exercise 7. Suppose further that p2 points to a node of type Node that is on a linked list and is not the last node on the
list. Write code that will delete the node after the node pointed to by p2.
After this code is executed, the linked list should be the same, except that
there will be one less node on the linked list. Hint: You might want to
declare another pointer variable to use.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.