Python program to insert a new node at the end of the Circular Linked List

python tutorials and learn python

Created with Sketch.

Python program to insert a new node at the end of the Circular Linked List

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 the last node (tail) of the list, and the previous tail will be the second last node.

Python program to insert a new node at the end of the Circular Linked List

After inserting the new node to the end of the list

Python program to insert a new node at the end of the Circular Linked 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:
  • It first checks whether the head is null (empty list), then it will insert the node as the head.
  • Both head and tail will point to the newly added node.
  • If the list is not empty, then the newly added node will become the new tail, and previous tail will point to the new node as its next node. The new tail will point to the head.

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.

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 to the end of the list.  
  14.   def addAtEnd(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.         print(“Adding nodes to the end of the list: “);
  37.         #Prints each node by incrementing pointer.  
  38.         print(current.data),
  39.         while(current.next != self.head):
  40.             current = current.next;
  41.             print(current.data),
  42.         print(“\n”);
  43. class CircularLinkedList:
  44.     cl = CreateList();
  45.     #Adding 1 to the list  
  46.     cl.addAtEnd(1);
  47.     cl.display();
  48.     #Adding 2 to the list  
  49.     cl.addAtEnd(2);
  50.     cl.display();
  51.     #Adding 3 to the list  
  52.     cl.addAtEnd(3);
  53.     cl.display();
  54.     #Adding 4 to the list  
  55.     cl.addAtEnd(4);
  56.     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

 

Leave a Reply

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