資料結構

Inserting a node named "new" after a node named "p" in a doubly linked list (assuming p is not the last node), which of the following four lines of code is in the correct order?

1. new->next = p->next;
2. p->next->prev = new;
3. p->next = new;
4. new->prev = p;