Which scenario is most naturally modeled by a circular singly linked list?

• A. Iterating elements in a round-robin fashion without a terminating end.
• B. A simple linear list that ends with NULL.
• C. A heap data structure.
• D. A tree traversal.

Answer: (A)

In a circular singly linked list, the last node points back to the first, so there is no natural end to traversal. This makes repeating a sequence seamless, which is perfect for round-robin scheduling where each item gets a turn in a fixed order and the cycle continues indefinitely. You can keep moving to the next node, and after the last one, you automatically return to the start without needing a special stop condition.

In contrast, a linear list ends with a null reference, signaling termination; a heap is usually represented using an array and supports heap operations rather than cyclic traversal; a tree has branching structure and distinct paths, not a simple cycle.