The number of pointer changes required for inserting a node between two given nodes in the linked implementation of a doubly linked list is ______.
Show answerHide answer
Correct answer: (D) Four
Explanation
The new node's next and prev pointers are set, and the next pointer of the previous node and the prev pointer of the following node are updated. That makes 4 pointer changes.