# Program to Delete a New Node From the End of the Circular Linked List

Program to Delete a New Node From 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 delete a new node from the end of the circular linked list.

### Explanation

In this program, we will create a circular linked list and delete a node from the end of the list. If the list is empty, it will display the message "List is empty". If the list is not empty, we will loop through the list till second last node is reached. We will make second last node as the new tail, and this new tail will point to head and delete the previous tail.

Circular linked list after deleting node from end

Here, in the above list, D is the last node which needs to be deleted. We will iterate through the list till C. Make C as new tail and C will point back to head A.

### 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: deleteEnd() and display() .
3. deleteEnd() will delete the node from the end of the list:
1. It first checks whether the head is null (empty list) then, it will return from the function as there is no node present in the list.
2. If the list is not empty, it will check whether list has only one node.
3. If the list has only one node, it will set both head and tail to null.
4. If the list has more than one node then, iterate through the loop till current.next!= tail.
5. Now, current will point to the node previous to tail. Make current as new tail and tail will point to head thus, deletes the node from last.
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 the new node at 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;

#Deletes node from end of the list
def deleteEnd(self):
#Checks whether list is empty
return;
else:
#Checks whether contain only one element
#Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != self.tail):
current = current.next;
#Second last element will be new tail
self.tail = current;
#Tail will point to head as it is a circular linked list
#If the list contains only one element
#Then it will remove it and both head and tail will point to null
else:

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

cl = CreateList();
#Printing original list
print("Original List:");
cl.display();
cl.deleteEnd();
#Printing updated list
print("Updated List:");
cl.display();
```

Output:

```Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
```

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

//Deletes node from end of the list
void deleteEnd() {
//Checks whether list is empty
return;
}
else {
//Checks whether contain only one element
//Loop will iterate till the second last element as current.next is pointing to tail
while(current->next != tail) {
current = current->next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
}
}
}

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

int main()
{
//Printing original list
printf("Original List:\n ");
display();
deleteEnd();
//Printing updated list
printf("Updated List:\n ");
display();
}

return 0;
}
```

Output:

```Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
```

### JAVA

```public class DeleteEnd {
//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;
}
}

//Deletes node from end of the list
public void deleteEnd() {
//Checks whether list is empty
return;
}
else {
//Checks whether contain only one element
//Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != tail) {
current = current.next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
}
}
}

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

public static void main(String[] args) {
DeleteEnd cl = new DeleteEnd();
//Printing original list
System.out.println("Original List: ");
cl.display();
cl.deleteEnd();
//Printing updated list
System.out.println("Updated List: ");
cl.display();
}
}
}
```

Output:

```Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
```

### 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>{
public 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;
}
}

//Deletes node from end of the list
public void deleteEnd() {
//Checks whether list is empty
return;
}
else {
//Checks whether contain only one element
//Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != tail) {
current = current.next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
}
}
}

//Displays all the nodes in the list
public void display(){
Console.WriteLine("List is empty");
}
else{
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>();
//Printing original list
Console.WriteLine("Original List: ");
cl.display();
cl.deleteEnd();
//Printing updated list
Console.WriteLine("Updated List: ");
cl.display();
}
}
}
}
```

Output:

```Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
```

### 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.
public \$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;
}
}

//Deletes node from end of the list
function deleteEnd() {
//Checks whether list is empty
return;
}
else {
//Checks whether contain only one element
//Loop will iterate till the second last element as current.next is pointing to tail
while(\$current->next != \$this->tail) {
\$current = \$current->next;
}
//Second last element will be new tail
\$this->tail = \$current;
//Tail will point to head as it is a circular linked list
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
}
}
}

//Displays all the nodes in the list
function display() {
echo "List is empty";
}
else {
do{
//Prints each node by incrementing pointer.
echo(" \$current->data");
\$current = \$current->next;
echo "<br>";
}
}
}
\$cl = new CreateList();
//Printing original list
echo "Original List:<br>";
\$cl->display();
\$cl->deleteEnd();
//Printing updated list
echo "Updated List:<br>";
\$cl->display();
}
?>
</body>
</html>
```

Output:

```Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
```

Next Topic#