# C++ - Delete a node at the given position in the Circular Singly Linked List

In this method, a node at the specified position in the circular singly linked list is deleted. For example - if the given list is 10->20->30 and the 2^{nd} node is deleted, the list becomes 10->20.

First, create two nodes *temp* and *nodeToDelete* to traverse through the list and track the node to delete respectively. After that count the number of elements in the list to check whether the specified position is valid or not (It must lie in the range of [1, *n*], where *n* is number of elements in the list). If the specified valid position is 1 and head is the only element in the list, then make the head as null. If the specified valid position is 1 and list contains more than one elements, then make next of head as new head and adjust links accordingly. If the specified valid position is greater than 1 then traverse to the node previous to the given position and delete the given node and adjust links accordingly.

The function *pop_at* is created for this purpose. It is a **5-step process**.

void pop_at(int position) { //1. create two nodes - temp and nodeToDelete // to traverse and track the node to delete Node* nodeToDelete = head; Node* temp = head; int NoOfElements = 0; //2. Find the number of elements in the list if(temp != NULL) { NoOfElements++; temp = temp->next; } while(temp != head) { NoOfElements++; temp = temp->next; } //3. check if the specified position is valid if(position < 1 || position > NoOfElements) { cout<<"\nInavalid position."; } else if (position == 1) { //4. if the position is 1 and head is the only element // in the list, then make it null, else make next // of head as new head and adjust links accordingly if(head->next == head) { head = NULL; } else { while(temp->next != head) temp = temp->next; head = head->next; temp->next = head; free(nodeToDelete); } } else { //5. Else, traverse to the node previous to // the given position and delete the given // node and adjust links accordingly temp = head; for(int i = 1; i < position-1; i++) temp = temp->next; nodeToDelete = temp->next; temp->next = temp->next->next; free(nodeToDelete); } }

The below is a complete program that uses above discussed concept to delete a node at a given position in the circular singly linked list.

#include <iostream> using namespace std; //node structure struct Node { int data; Node* next; }; class LinkedList { private: Node* head; public: LinkedList(){ head = NULL; } //Add new element at the end of the list void push_back(int newElement) { Node* newNode = new Node(); newNode->data = newElement; newNode->next = NULL; if(head == NULL) { head = newNode; newNode->next = head; } else { Node* temp = head; while(temp->next != head) temp = temp->next; temp->next = newNode; newNode->next = head; } } //Delete an element at the given position void pop_at(int position) { Node* nodeToDelete = head; Node* temp = head; int NoOfElements = 0; if(temp != NULL) { NoOfElements++; temp = temp->next; } while(temp != head) { NoOfElements++; temp = temp->next; } if(position < 1 || position > NoOfElements) { cout<<"\nInavalid position."; } else if (position == 1) { if(head->next == head) { head = NULL; } else { while(temp->next != head) temp = temp->next; head = head->next; temp->next = head; free(nodeToDelete); } } else { temp = head; for(int i = 1; i < position-1; i++) temp = temp->next; nodeToDelete = temp->next; temp->next = temp->next->next; free(nodeToDelete); } } //display the content of the list void PrintList() { Node* temp = head; if(temp != NULL) { cout<<"The list contains: "; while(true) { cout<<temp->data<<" "; temp = temp->next; if(temp == head) break; } cout<<endl; } else { cout<<"The list is empty.\n"; } } }; // test the code int main() { LinkedList MyList; //Add three elements at the end of the list. MyList.push_back(10); MyList.push_back(20); MyList.push_back(30); MyList.PrintList(); //Delete an element at position 2 MyList.pop_at(2); MyList.PrintList(); //Delete an element at position 1 MyList.pop_at(1); MyList.PrintList(); return 0; }

The above code will give the following output:

The list contains: 10 20 30 The list contains: 10 30 The list contains: 30