// Created by Pawan #include using namespace std; class Node { public: int data; Node *next; Node(int data) { this->data = data; this->next = NULL; } ~Node() { /* i think here we need to have the head somehow to be able to check if this->next == head, but the destructor can't take arguments... Help plz xD */ /* int x = this->data; if (this->next != NULL) { delete next; next = NULL; } cout << "Memory is free for node with data : " << x << endl; */ /* if (this->next == head) { free(this); } delete this->next; free(this); */ } }; // In circular LL we can't exactly decide which node is head or tail. So we're just considering head pointer to access the LL . // element is just for referencing where node to be insert. We're going do delete node next to element // Here we're not taking position in consideration as in SLL. void InsertNode(Node *&head, int pos, int data) { // For Empty List if (pos == 0) { if (head -> next == NULL) { head->data = data; head->next=head; } } else { // For Non-Empty List // assuming that the element is present in the list Node *temp = head; int count = 0; while (count < pos - 1) { temp = temp->next; count++; } Node *child = new Node(data); child->next = head; temp->next = child; } } void DisplaySCLL(Node *&head) { Node *temp = head; if (head == NULL) { cout << "Linked List is Empty" << endl; return; } else cout << "\n head : " << head->data << endl; if (head->next!=head) { do { cout << temp->data << " "; temp = temp->next; } while (temp != head); cout << endl; } } int main() { Node *node = new Node(10); // DisplaySCLL(head); InsertNode(node, 0, 15); InsertNode(node, 1, 22); InsertNode(node, 2, 30); printf("nodes inserted"); // // DeleteNode(head, 10); DisplaySCLL(node); // InsertNode(head, 15, 30); delete node; return 0; }

Circular list