# Circular Linked List Insertion in the middle in C++

## Program in C++ for Circular Linked List insertion in the middle

On this blog we will explore different codes to do Insertion in a Circular Linked List in the middle in C++
• Method 1: Using additional size variable
• Method 2: Using an additional function to calculate the size
Run
```#include<iostream>
using namespace std;

class Node
{
public:
int data;
Node *next;
};

int size = 0;

Node* newNode = new Node();
newNode->data = data;

// if its the first node being entered
size++;
return;
}

// traverse till last node in Circular Linked List
curr = curr->next;
}
curr->next = newNode;

size++;
}

Node* newNode = new Node();
newNode->data = data;

// if the LL was empty
// use insert function to insert
return;
}

// otherwise

// find correct insertion position for middle
int mid = (size % 2 == 0) ? (size/2) : (size+1)/2;

// Unique case when there is only one node in CLL
// we will be inserting at the last,
// inserting 2nd node at the last
// Example size = 1 will result in mid = 1 so entering after 1st node
// where size itself is 1 so entering last node
if(mid == size){
size++;
return;
}
// traverse to current mid position
while(--mid){
temp = temp->next;
}

newNode->next = temp->next;
temp->next = newNode;
size++;
}

// if there are no node in LL
return;

//need to take care of circular structure of LL
do{
cout <<temp->data << " ";         temp = temp->next;

cout << "\n" << endl;
}

int main()
{

return 0;
}
```

#### Output

```Linked List: 4 20

Linked List: 4 8 16 20

Linked List: 4 8 12 16 20 ```
Run
```#include<iostream>
using namespace std;

class Node
{
public:
int data;
Node *next;
};

int getSize(Node* node);

Node* newNode = new Node();
newNode->data = data;

// if its the first node being entered
return;
}

// traverse till last node in Circular Linked List
curr = curr->next;
}
curr->next = newNode;

}

Node* newNode = new Node();
newNode->data = data;

// if the LL was empty
// use insert function to insert
return;
}

// otherwise

// find correct insertion position for middle
int mid = (size % 2 == 0) ? (size/2) : (size+1)/2;

// Unique case when there is only one node in CLL
// we will be inserting at the last,
// inserting 2nd node at the last
// Example size = 1 will result in mid = 1 so entering after 1st node
// where size itself is 1 so entering last node
if(mid == size){
return;
}
// traverse to current mid position
while(--mid){
temp = temp->next;
}

newNode->next = temp->next;
temp->next = newNode;
}

int size = 0;

do{
node = node->next;
size++;

return size;
}
// if there are no node in LL
return;

//need to take care of circular structure of LL
do{
cout << temp->data << " "; temp = temp->next;

cout << "\n" << endl;
}

int main()
{

return 0;
}
```

#### Output

```Linked List: 4 20

Linked List: 4 8 16 20

Linked List: 4 8 12 16 20```

### 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