Python program to create a Circular Linked List of n nodes and display it in reverse order

python tutorials and learn python

Created with Sketch.

Python program to create a Circular Linked List of n nodes and display it in reverse order

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().
  3. add() will add a node to the list:
  • It first checks whether the head is null, then it will insert the node as the head.
  • Both head and tail will point to the newly added node.
  • 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.

a. display() will show all the nodes present in the list.

  • Define a new node ‘current’ that will point to the head.
  • Print current.data till current will points to head again.
  • Current will point to the next node in the list in each iteration.

a. reverse() will print the circular linked list in reverse order.

  • This method checks whether the next node to current is head which implies that, current is pointing to tail, then it will print the data of the tail node.
  • Recursively call reverse() by considering node next to current node and prints out all the nodes in reverse order starting from the tail.

PROGRAM:

  1. #Represents the node of list.  
  2. class Node:
  3.     def __init__(self,data):
  4.       self.data = data;
  5.       self.next = None;
  6. class CreateList:
  7.     #Declaring head and tail pointer as null.  
  8.     def __init__(self):
  9.       self.head = Node(None);
  10.       self.tail = Node(None);
  11.       self.head.next = self.tail;
  12.       self.tail.next = self.head;
  13.     #This function will add the new node at the end of the list.  
  14.     def add(self,data):
  15.       newNode = Node(data);
  16.       #Checks if the list is empty.  
  17.       if self.head.data is None:
  18.         #If list is empty, both head and tail would point to new node.  
  19.         self.head = newNode;
  20.         self.tail = newNode;
  21.         newNode.next = self.head;
  22.       else:
  23.         #tail will point to new node.  
  24.         self.tail.next = newNode;
  25.         #New node will become new tail.  
  26.         self.tail = newNode;
  27.         #Since, it is circular linked list tail will point to head.  
  28.         self.tail.next = self.head;
  29.     #Displays all the nodes in the list  
  30.     def display(self):
  31.         current = self.head;
  32.         if self.head is None:
  33.           print(“List is empty”);
  34.           return;
  35.         else:
  36.             #Prints each node by incrementing pointer.  
  37.             print(current.data),
  38.             while(current.next != self.head):
  39.                 current = current.next;
  40.                 print(current.data),
  41.     #Reverse the order of the nodes present in the list.  
  42.     def reverse(self, current):
  43.         #Checks if the next node is head, if yes then prints it.  
  44.         if(current.next == self.head):
  45.             print(current.data),
  46.             return;
  47.         #Recursively calls the reverse function  
  48.         self.reverse(current.next);
  49.         print(current.data),
  50. class CircularLinkedList:
  51.     cl = CreateList();
  52.     #Adds data to the list  
  53.     cl.add(1);
  54.     cl.add(2);
  55.     cl.add(3);
  56.     cl.add(4);
  57.     cl.add(5);
  58.     cl.add(6);
  59.     print(“Original List: “);
  60.     cl.display();
  61.     print(“\nReversed List: “);
  62.     #Print reversed list  
  63.     cl.reverse(cl.head);

Output:

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

Leave a Reply

Your email address will not be published. Required fields are marked *