How do I traverse a circular linked list?

How do I traverse a circular linked list?

To traverse a circular linked list, start from a node and keep moving to the next node until you reach the starting node again.

Can you show me a code example for that?

Sure! Here's a simple example in Python:

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class CircularLinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            new_node.next = self.head
        else:
            current = self.head
            while current.next != self.head:
                current = current.next
            current.next = new_node
            new_node.next = self.head

    def traverse(self):
        if not self.head:
            return
        current = self.head
        while True:
            print(current.data)
            current = current.next
            if current == self.head:
                break

# Example usage:
cll = CircularLinkedList()
cll.append(1)
cll.append(2)
cll.append(3)
cll.traverse()

What happens if I forget to check for the head node?

If you forget to check for the head node, your traversal might lead to an infinite loop, as you won't have a stopping condition.

Are there any other methods to traverse a circular linked list?

Yes, you can also use a counter to limit the number of iterations or use a recursive approach, but the iterative method is most common.