In a doubly linked list, removing a middle node requires updating which pointers?

• A. Both its prev.next and next.prev pointers.
• B. Only its next pointer.
• C. Only its prev pointer.
• D. Head and tail pointers only.

Answer: (D)

When removing a middle node in a doubly linked list, you must re-link the two neighbors so the list stays connected. The node being removed has a previous node and a next node. You update the previous node’s next pointer to point to the next node, and you update the next node’s previous pointer to point to the previous node. This bypasses the removed node and keeps the chain intact.

Head and tail pointers only need updating if the node you’re removing is at the ends of the list. So for a middle node, you don’t touch head or tail; you adjust the two surrounding pointers instead.