What is a key property of circular linked lists that differentiates them from linear linked lists?

• A. There is always a sentinel node at end
• B. There is no null terminator; traversal wraps around
• C. Nodes store a hash value to signal end
• D. Traversal ends at a designated 'end' node

Answer: (B)

The main idea is that circular linked lists form a cycle, so there is no null terminator to signal the end. In a circular list, the next pointer of the last node points back to the first node, which means traversal can keep going indefinitely unless you stop it intentionally—typically by stopping when you return to your starting node or after counting a known number of nodes. This wrap-around behavior is what sets circular lists apart from linear ones, which end when their next pointer is null.

That’s why this option is the best: it captures the absence of a terminating null and the wrap-around traversal that defines circular lists. A sentinel node at the end isn’t required by the concept, and storing a hash value or ending at a designated end node would imply a non-circular structure, which doesn’t align with how circular lists operate.