How do I implement a circular linked list in C++?

How do I implement a circular linked list in C++?

To implement a circular linked list in C++, you need to define a node structure and manage pointers carefully. Would you like a code example?

Yes, please provide a simple code example.

Here's a basic implementation:

struct Node {
    int data;
    Node* next;
};

class CircularLinkedList {
    Node* head;
public:
    CircularLinkedList() : head(nullptr) {}
    void insert(int value) {
        Node* newNode = new Node{value, nullptr};
        if (!head) {
            head = newNode;
            head->next = head; // Point to itself
        } else {
            Node* temp = head;
            while (temp->next != head) {
                temp = temp->next;
            }
            temp->next = newNode;
            newNode->next = head;
        }
    }
};

This creates a circular linked list where the last node points back to the head.

How do I traverse this circular linked list?

To traverse a circular linked list, you can start from the head and continue until you reach the head again. Here's a simple function:

void traverse() {
    if (!head) return;
    Node* temp = head;
    do {
        std::cout << temp->data << " ";
        temp = temp->next;
    } while (temp != head);
}