3.4 Removing nodes from the headless single-linked list

Title: There is a single linked list, there is no head pointer, there is now a pointer to the middle of the list of nodes, requiring the deletion of this node.

Method: Because there is no way to seek the pointer to find the node to delete the previous node.

So try to find another way.

Set up a new pointer to the next node of the node you want to delete, and then change the data inside the two nodes! Then delete the next node to delete the node!

That's OK!

Code:

void Deleterandomnode (node *pcurrent) {    assert (pcurrent! = NULL);    Node *pnext = pcurrent->next;    if (pnext! = NULL) {        Pcurrent->next = pnext->next;        Pcurrent->data = pnext->data;        Delete pnext;}    }

3.4 Removing nodes from the headless single-linked list