# Program to Create a Circular Linked List of N Nodes and Display it in Reverse Order

Program to Create a Circular Linked List of N Nodes and Display it in Reverse Order on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph etc.

## Q. Program to create a circular linked list of n nodes and display it in reverse order.

### Explanation

In this program, we create a circular linked list, then traverse the list in the reverse order and print the nodes.

### 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: add(), display() and reverse().
1. It first checks whether the head is null, then it will insert the node as the head.
2. Both head and tail will point to the newly added node.
3. If the head is not null, the new node will be the new tail, and new tail will point to head as it is a circular linked list.
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.
5. reverse() will print the circular linked list in reverse order.
1. This method checks whether next node to current is head which implies that, current is pointing to tail, then it will print the data of the tail node.
2. Recursively call reverse() by considering node next to current node and prints out all the nodes in reverse order starting from the tail.

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

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

#Reverse the order of the nodes present in the list.
def reverse(self, current):
#Checks if the next node is head, if yes then prints it.
print(current.data),
return;
#Recursively calls the reverse function
self.reverse(current.next);
print(current.data),

cl = CreateList();
print("Original List: ");
cl.display();
print("\nReversed List: ");
#Print reversed list
```

Output:

```Original List:
1 2 3 4 5 6
Reversed List:
6 5 4 3 2 1
```

### 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{
do{
//Prints each node by incrementing pointer.
printf("%d ", current->data);
current = current->next;
printf("\n");
}
}

//Reverse the order of the nodes present in the list.
void reverse(struct node *current) {
//Checks if the next node is head, if yes then prints it.
printf("%d ",current->data);
return;
}
//Recursively calls the reverse function
reverse(current->next);
printf("%d ",current->data);
}

int main()
{
printf("Original List:\n");
display();
printf("Reversed List:\n");
//Print reversed list

return 0;
}
```

Output:

```Original List:
1 2 3 4 5 6
Reversed List:
6 5 4 3 2 1
```

### JAVA

```public class ReverseList {
//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 {
do{
//Prints each node by incrementing pointer.
System.out.print(" "+ current.data);
current = current.next;
System.out.println();
}
}

//Reverse the order of the nodes present in the list.
public void reverse(Node current) {
//Checks if the next node is head, if yes then prints it.
System.out.print(" "+current.data);
return;
}
//Recursively calls the reverse function
reverse(current.next);
System.out.print(" "+current.data);
}

public static void main(String[] args) {
ReverseList cl = new ReverseList();
System.out.println("Original List: ");
cl.display();
System.out.println("Reversed List: ");
//Print reversed list
}
}
```

Output:

```Original List:
1 2 3 4 5 6
Reversed List:
6 5 4 3 2 1
```

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

}

//Displays all the nodes in the list
public void display(){
Node<T> current;
Console.WriteLine("List is empty");
}
else{
//Prints each node by incrementing pointer.
Console.Write(" "+current.data);
}
}
Console.WriteLine();
}

//Reverse the order of the nodes present in the list.
public void reverse(Node<T> temp) {
//Checks if the next node is head, if yes then prints it.
Console.Write(" "+temp.data);
return;
}
//Recursively calls the reverse function
reverse(temp.next);
Console.Write(" "+temp.data);
}
}

public static void Main()
{

CreateList<int> cl = new CreateList<int>();
Console.WriteLine("Original List: ");
cl.display();
Console.WriteLine("Reversed List: ");
//Print reversed list
}
}
}
```

Output:

```Original List:
1 2 3 4 5 6
Reversed List:
6 5 4 3 2 1
```

### 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;
}
}
//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>";
}
}
//Reverse the order of the nodes present in the list.
function reverse(\$current) {
//Checks if the next node is head, if yes then prints it.
echo " \$current->data";
return;
}
//Recursively calls the reverse function
\$this->reverse(\$current->next);
echo " \$current->data";
}

}
\$cl = new CreateList();
echo "Original List: <br>";
\$cl->display();
echo "<br>Reversed List: <br>";
//Print reversed list
?>
</body>
</html>
```

Output:

```Original List:
1 2 3 4 5 6
Reversed List:
6 5 4 3 2 1
```

Next Topic#