Lecture 203:- Circular Linked List

A circular linked list is a linked list in which the last node points back to the first node, forming a closed loop. To create a circular linked list, the next pointer of the last node will point to the head node.

Below is an example of a C++ class for a circular linked list:

cppCopy code

#include <iostream> class Node { public:    int data;    Node* next;    Node(int data) : data(data), next(nullptr) {} }; class CircularLinkedList { private:    Node* head; public:    CircularLinkedList() : head(nullptr) {}    ~CircularLinkedList() {        if (head) {            Node* current = head;            do {                Node* temp = current;                current = current->next;                delete temp;            } while (current != head);        }    }    void insertEnd(int data) {        Node* newNode = new Node(data);        if (!head) {            head = newNode;            head->next = head; // Make the only node point to itself        } else {            Node* current = head;            while (current->next != head) {                current = current->next;            }            current->next = newNode;            newNode->next = head; // Make the new node point back to the head        }    }    void print() {        if (!head) {            std::cout << "List is empty." << std::endl;            return;        }        Node* current = head;        do {            std::cout << current->data << " -> ";            current = current->next;        } while (current != head);        std::cout << "Head" << std::endl;    } }; int main() {    CircularLinkedList list;    list.insertEnd(1);    list.insertEnd(2);    list.insertEnd(3);    list.print(); // Output: 1 -> 2 -> 3 -> Head    return 0; }

In this example, the CircularLinkedList class is similar to the regular linked list class, but there is a slight difference in the insertEnd method to ensure the circular property.

In the main function, we demonstrate how to use the CircularLinkedList class by creating a circular linked list, inserting elements, and printing the circular linked list. Note that to print the circular linked list, we traverse through the list until we reach the head again.