How do I insert a node in a circular linked list?

How do I insert a node in a circular linked list?

To insert a node in a circular linked list, you need to adjust the pointers of the existing nodes. Do you want to insert at the beginning, end, or a specific position?

Let's say I want to insert at the end.

First, create the new node. Then, traverse to the last node of the list, update its next pointer to the new node, and finally, point the new node's next to the head.

Can you provide 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 insert_at_end(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            new_node.next = self.head
        else:
            temp = self.head
            while temp.next != self.head:
                temp = temp.next
            temp.next = new_node
            new_node.next = self.head