📅  最后修改于: 2022-03-11 14:44:45.174000             🧑  作者: Mango
// Case 4
struct Node * insertAfterNode(struct Node *head, struct Node *prevNode, int data){
struct Node * ptr = (struct Node *) malloc(sizeof(struct Node));
ptr->data = data;
ptr->next = prevNode->next;
prevNode->next = ptr;
return head;
}