In a doubly linked list, what pointers exist in each node?

• A. Next and Prev.
• B. Left and Right.
• C. Parent and Child.
• D. Top and Bottom.

Answer: (A)

In a doubly linked list each node stores two pointers: one to the next node and one to the previous node. These two links, typically called next and prev, allow you to traverse the list in either direction. The ability to move backward as well as forward is what distinguishes a doubly linked list from a singly linked list, which only has a next pointer. At the ends, the head’s previous pointer and the tail’s next pointer are usually null, marking the boundaries. Other names like left/right, parent/child, or top/bottom aren’t used to describe the standard structure of a doubly linked list.