Which of the following describes the Node's connectivity in a doubly linked list?

• A. Each node links only to the next node
• B. Each node links to previous and next nodes
• C. Nodes are connected via array indices
• D. Nodes have no links

Answer: (B)

In a doubly linked list, each node carries two references: one to the next node and one to the previous node. This setup makes traversal bidirectional possible, so you can move forward or backward through the list without starting from the head each time. That’s the defining feature of a doubly linked list and is what the description that mentions links to both the previous and the next node captures. By contrast, a singly linked list only stores a link to the next node, which limits backward movement. An arrangement based on array indices represents a different model of connectivity, not node-to-node links, and saying nodes have no links would describe a non-connected structure. The extra link per node means more memory usage, but it provides flexible traversal and easier insertions or deletions in the middle of the list.