# Deletion from beginning in circular linked list in C++

## How to delete from beginning in circular linked list?

In this article, we will learn how to write a program for deletion from beginning in circular linked list in C++. So to delete node from circular linked list we first need to create a circular linked list and then we can delete the node from beginning. And after deleting the first node we will make second node as head of the list and will link the pointer of last node with the new head node.

## Steps to delete from beginning in circular linked list in CPP

1. If the circular linked list is empty, terminate function.
2. Else define two node pointers(p and temp).
4. Now traverse until pointer of p points to the head
5. Now store head in the second node pointer i.e temp.
6. Make second node as new head of the list.
8. Free temp i.e the node pointer storing the previous head of the list.
```struct Node
{
int num;
struct Node *next;
};```

## Algorithm to write a CPP program to delete from beginning in Circular Linked List

• STRUCT P &TEMP
• P=P->NEXT
• END WHILE
• FREE(TEMP)

## C++ program for deletion from beginning in circular linked list

Run
```#include<iostream>
using namespace std;

struct Node
{
int num;
struct Node *next;

void insertStart (struct Node **head, int data)	//function to create linked list
{
struct Node *newNode = (struct Node *) malloc (sizeof (struct Node));
newNode->num = data;

// if its the first node being entered
{

cout << newNode->num << " Inserted\n";
return;
}

// if CLL already as >=1 node

// traverse till last node in CLL
{
curr = curr->next;
}

curr->next = newNode;		// last node's next as this new node

cout << newNode->num << " Inserted\n";

// previous head node becomes 2nd node
}

//function to delete beginning node from the circular linked list
{
struct Node *p, *temp;
{
p = p->next;
}

free (temp);
}

{

cout << "\nCircular Linked List : " << endl;

// if circular linked list is empty currently
return;

// since we need to take care of circular nature of linked list
do
{
cout << temp->num << " ";
temp = temp->next;

}
cout << endl;
}

int main ()				//main function
{
// first node will be null at creation

cout << "Before insertion ";
cout << "After insertion ";
return 0;
}

```
```Output:
1 Inserted
2 Inserted
3 Inserted
4 Inserted
5 Inserted
Before insertion
5 4 3 2 1
After insertion
4 3 2 1```

### Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

## Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

## Checkout list of all the video courses in PrepInsta Prime Subscription

• Introduction to Circular Linked List
• Circular Linked List in –
C | C++ | Java
• Insertion in Circular Linked List –
C | C++ | Java
• Insertion at the beginning–
C | C++ | Java
• Insertion at the end –
C | C++ | Java
• Insertion at nth position –
C | C++ | Java
• Deletion in Circular Linked List –
C | C++ | Java
• Deletion from beginning in Circular Linked List –
C | C++ | Java
• Deletion from nth position in Circular Linked List –
• Deletion from end in Circular Linked List –
C | C++ | Java
• Insertion and Deletion in Circular Linked List – C | C++ | Java
• Split a Circular Linked List in two halves –
C | C++ | Java
• Count nodes in Circular Linked List –
C | C++ | Java
• Sorted Insert In Circular Linked List –
C | C++ | Java
• Insertion in the middle in Circular Linked List –
C | C++ | Java