Progarm to delete previous node in linked list?

Answer 1

struct LinkedListNode

{

void* data;

LinkedListNode* next;

};

LinkedListNode* head;

LinkedListNode* tmp;

while (head)

{

tmp head->next;

free(head);

head tmp;

}

Answer 2

To delete the previous node (parent) in a linked list, you need the address of the node prior to the previous node. (grandparent)

If the list is doubly linked, you can find this easily by backtracking through the .next member. If, as is usual, the list is singly linked, you can find this only by iterating through the whole list, remembering two levels of addresses until you find the address of the current node.

Once you have the address of the grandparent, adjust it (and if necessary the current node) to remove the reference to the parent - then delete the parent.

Of course, you will need to consider if the current node has no parent, or no grandparent, and handle that accordingly. This will mean adjusting the head pointer (no grandparent) or throwing an exception (no parent).