Which statement best describes the data stored in each Node of the LList?

• A. Only the value
• B. The value and a single pointer
• C. The value and pointers to both the previous and next nodes
• D. Only the pointers, no data

Answer: (C)

The main idea here is that a node in a doubly linked list carries both the stored value and references to its neighbors. Each node holds the data (the value) plus two pointers: one to the previous node and one to the next node. This design enables moving forward and backward through the list efficiently, and it makes insertions or deletions near a node straightforward because you only need to update a couple of pointers. If a node had only the value or only a single pointer, it would be a singly linked list (forward traversal only) or a data-only node (no connections), which wouldn’t support bidirectional traversal or easy two-way updates. If a node stored only pointers with no data, the list wouldn’t carry meaningful elements.