What is a Circular Linked List?

Approach: Describe a list where the last node points to the first.

A sequence of nodes where each node contains data and a reference to the next node, and the last node's reference points back to the first node.

Follow-up: How do you avoid infinite loops during traversal?

Key concepts: traversal, pointers.