# Program to Insert a New Node at the End of the Circular Linked List

Program to Insert a New Node at the End of the Circular Linked List on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc.

## Q. Program to insert a new node at the end of the circular linked list.

### Explanation

In this program, we will create a circular linked list and insert every new node at the end of the list. If the list is empty, then head and tail will point to the newly added node. If the list is not empty, the newly added node will become the new tail of the list. The previous tail will point to new node as its next node. Since it is a circular linked list; the new tail will point to head. In other words, the new node will become last node (tail) of the list, and the previous tail will be the second last node.

After inserting new node to the end of the list

New represents the newly added node. D is the previous tail. When new is added to the end of the list, it will become new tail and D will point to new.

### Algorithm

1. Define a Node class which represents a node in the list. It has two properties data and next which will point to the next node.
2. Define another class for creating the circular linked list and it has two nodes: head and tail. It has two methods: addAtEnd() and display() .
3. addAtEnd() will add the node to the end of the list:
1. It first checks whether the head is null (empty list), then it will insert the node as the head.
2. Both head and tail will point to the newly added node.
3. If the list is not empty, then the newly added node will become the new tail, and previous tail will point to new node as its next node. The new tail will point to the head.
4. display() will show all the nodes present in the list.
1. Define a new node 'current' that will point to the head.
2. Print current.data till current will points to head again.
3. Current will point to the next node in the list in each iteration.

## Solution

### Python

```#Represents the node of list.
class Node:
def __init__(self,data):
self.data = data;
self.next = None;

class CreateList:
#Declaring head and tail pointer as null.
def __init__(self):
self.tail = Node(None);

#This function will add to the end of the list.
newNode = Node(data);
#Checks if the list is empty.
#If list is empty, both head and tail would point to new node.
self.tail = newNode;
else:
#tail will point to new node.
self.tail.next = newNode;
#New node will become new tail.
self.tail = newNode;

#Displays all the nodes in the list
def display(self):
print("List is empty");
return;
else:
print("Adding nodes to the end of the list: ");
#Prints each node by incrementing pointer.
print(current.data),
current = current.next;
print(current.data),
print("\n");

cl = CreateList();
cl.display();
cl.display();
cl.display();
cl.display();
```

Output:

```Adding nodes to the end of the list:
1
Adding nodes to the end of the list:
1 2
Adding nodes to the end of the list:
1 2 3
Adding nodes to the end of the list:
1 2 3 4
```

### C

```#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//Represents the node of list.
struct node{
int data;
struct node *next;
};

//Declaring head and tail pointer as null.
struct node *tail = NULL;

//This function will add the new node at the end of the list.
//Create new node
struct node *newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
//Checks if the list is empty.
//If list is empty, both head and tail would point to new node.
tail = newNode;
}else {
//tail will point to new node.
tail->next = newNode;
//New node will become new tail.
tail = newNode;
}
}

//This function will display the nodes of circular linked list
void display(){
printf("List is empty");
}
else{
printf("Adding nodes to the end of the list: \n");
do{
//Prints each node by incrementing pointer.
printf("%d ", current->data);
current = current->next;
printf("\n");
}
}

int main()
{
display();
display();
display();
display();

return 0;
}
```

Output:

```Adding nodes to the end of the list:
1
Adding nodes to the end of the list:
1 2
Adding nodes to the end of the list:
1 2 3
Adding nodes to the end of the list:
1 2 3 4
```

### JAVA

```public class InsertAtEnd {
//Represents the node of list.
public class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
}
}

//Declaring head and tail pointer as null.
public Node tail = null;

//This function will add the new node at the end of the list.
//Create new node
Node newNode = new Node(data);
//Checks if the list is empty.
//If list is empty, both head and tail would point to new node.
tail = newNode;
}
else {
//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
}
}

//Displays all the nodes in the list
public void display() {
System.out.println("List is empty");
}
else {
System.out.println("Adding nodes to the end of the list: ");
do{
//Prints each node by incrementing pointer.
System.out.print(" "+ current.data);
current = current.next;
System.out.println();
}
}

public static void main(String[] args) {
InsertAtEnd cl = new InsertAtEnd();

cl.display();
cl.display();
cl.display();
cl.display();
}
}
```

Output:

```Adding nodes to the end of the list:
1
Adding nodes to the end of the list:
1 2
Adding nodes to the end of the list:
1 2 3
Adding nodes to the end of the list:
1 2 3 4
```

### C#

```using System;
{
public class Program
{
//Represents the node of list.
public class Node<T>{
public T data;
public Node<T> next;
public Node(T value) {
data = value;
next = null;
}
}

public class CreateList<T>{
protected Node<T> tail = null;

//This function will add the new node at the end of the list.
//Create new node
Node<T> newNode = new Node<T>(data);
//Checks if the list is empty.
tail = newNode;

}else{

//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
}

}
//Displays all the nodes in the list
public void display(){
Console.WriteLine("List is empty");
}
else{
Console.WriteLine("Adding nodes to the end of the list: ");
do{
//Prints each node by incrementing pointer.
Console.Write(" "+ current.data);
current = current.next;
Console.WriteLine();
}
}
}

public static void Main()
{

CreateList<int> cl = new CreateList<int>();

cl.display();
cl.display();
cl.display();
cl.display();
}
}
}
```

Output:

```Adding nodes to the end of the list:
1
Adding nodes to the end of the list:
1 2
Adding nodes to the end of the list:
1 2 3
Adding nodes to the end of the list:
1 2 3 4
```

### PHP

```<!DOCTYPE html>
<html>
<body>
<?php
//Represents the node of list.
class Node{
public \$data;
public \$next;
function __construct(\$data){
\$this->data = \$data;
\$this->next = NULL;
}
}
class CreateList{
//Declaring head and tail pointer as null.
private \$tail;
function __construct(){
\$this->tail = NULL;
}
//This function will add the new node at the end of the list.
//Create new node
\$newNode = new Node(\$data);
//Checks if the list is empty.
//If list is empty, both head and tail would point to new node.
\$this->tail = \$newNode;
}
else{
//tail will point to new node.
\$this->tail->next = \$newNode;
//New node will become new tail.
\$this->tail = \$newNode;
}
}
//Displays all the nodes in the list
function display() {
echo "List is empty";
}
else {
echo "Adding nodes to the end of the list: <br>";
do{
echo(" \$current->data");
\$current = \$current->next;
echo "<br>";
}
}
}
\$cl = new CreateList();
\$cl->display();
\$cl->display();
\$cl->display();
\$cl->display();
?>
</body>
</html>
```

Output:

```Adding nodes to the end of the list:
1
Adding nodes to the end of the list:
1 2
Adding nodes to the end of the list:
1 2 3
Adding nodes to the end of the list:
1 2 3 4
```

Next Topic#