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

python tutorials and learn python

Created with Sketch.

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

In this program, we will create a circular linked list and insert every new node at the beginning 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, then we will store the data of the head into a temporary node temp and make new node as the head. This new head will point to the temporary node. In simple words, the newly added node will be the first node(head) and previous head(temp) will become the second node of the list.

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

After inserting the new node to the beginning of the list.

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

New represents the newly added node. Earlier A was the head of the list. When new is added to the beginning of the list, new will become the new head, and it will point to the previous head, i.e., 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: addAtStart() and display() .
  3. addAtStart() will add the node to the beginning 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 a newly added node.
  • If the list is not empty, then the newly added node will become the new head, and it will point to the previous 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 at the start of the list.  
  14.   def addAtStart(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.         #Store data into temporary node  
  24.         temp = self.head;
  25.         #New node will point to temp as next node  
  26.         newNode.next = temp;
  27.         #New node will be the head node  
  28.         self.head = newNode;
  29.         #Since, it is circular linked list tail will point to head.  
  30.         self.tail.next = self.head;
  31.   #Displays all the nodes in the list  
  32.   def display(self):
  33.     current = self.head;
  34.     if self.head is None:
  35.       print(“List is empty”);
  36.       return;
  37.     else:
  38.         print(“Adding nodes to the start of the list: “);
  39.         #Prints each node by incrementing pointer.  
  40.         print(current.data),
  41.         while(current.next != self.head):
  42.             current = current.next;
  43.             print(current.data),
  44.         print(“\n”);
  45. class CircularLinkedList:
  46.   cl = CreateList();
  47.   #Adding 1 to the list  
  48.   cl.addAtStart(1);
  49.   cl.display();
  50.   #Adding 2 to the list  
  51.   cl.addAtStart(2);
  52.   cl.display();
  53.   #Adding 3 to the list  
  54.   cl.addAtStart(3);
  55.   cl.display();
  56.   #Adding 4 to the list  
  57.   cl.addAtStart(4);
  58.   cl.display();

Output:

Adding nodes to the start of the list: 
1
Adding nodes to the start of the list: 
2 1
Adding nodes to the start of the list: 
3 2 1
Adding nodes to the start of the list: 
4 3 2 1

Leave a Reply

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