Delete single-linked list node I, given head node and I node.

Analysis: the given head node is clearly intended to confuse the problem solver

typedef struct n{ int data; struct n *next; }link; void delNodeI(node *nodeI) { node *iNext=nodeI->next; If (iNext==NULL) {nodeI==NULL; }else { nodeI->data=iNext->data; nodeI->next=iNext->next; free(iNext); }}Copy the code