Circular Linked List in PYTHON

 So here is the Python code for Circular Linked List :-

class Node: def __init__(self,val): self.data = val self.next = None class Clinklist: def __init__(self): self.head = None def insert_begin(self, val): temp = Node(val) temp.next = self.head if self.head is not None: curr = self.head while curr.next is not self.head: curr = curr.next curr.next = temp else: temp.next = temp self.head = temp def printlist(self): curr = self.head if self.head is not None: while curr.next is not self.head: print(curr.data,"->",end=" ") curr = curr.next print(curr.data,"->",end=" ") print("Head") else: print("None") # Insert at end. def insert_end(self, val): if self.head is not None: temp = Node(val) curr = self.head while curr.next != self.head: curr = curr.next curr.next = temp temp.next = self.head else: self.insert_begin(val) # Insert at k. Here k starts from 0. def insert_k(self, k, val): temp = Node(val) curr = self.head for i in range(0, k-1): curr = curr.next temp.next = curr.next curr.next = temp # Remove at beginning. def remove_beg(self): temp = self.head if self.head is not None: self.head = temp.next else: print("Invalid!") # Remove at end. def remove_end(self): self.remove_k(self.lens()-1) # Remove at k. Again, k starts from 0. def remove_k(self, k): curr = self.head for i in range(0, k-1): curr = curr.next temp = curr for i in range(0, 2): curr = curr.next temp2 = curr temp.next = temp2 # A function to count the number of elements in the circular linked list. def lens(self): curr = self.head i = 0 while curr.next != self.head: curr = curr.next i = i+1 return i+1 Clinklist1 = Clinklist() Clinklist1.insert_begin(1) Clinklist1.insert_begin(2) Clinklist1.insert_begin(3) Clinklist1.printlist() Clinklist1.insert_end(9) Clinklist1.printlist() Clinklist1.insert_k(1, 10) Clinklist1.printlist() Clinklist1.remove_beg() Clinklist1.printlist() Clinklist1.remove_k(2) Clinklist1.printlist() Clinklist1.remove_k(3) Clinklist1.printlist() Clinklist1.insert_begin(3) Clinklist1.printlist() Clinklist1.remove_k(3) Clinklist1.printlist() Clinklist1.remove_end() Clinklist1.printlist()
3 -> 2 -> 1 -> Head 3 -> 2 -> 1 -> 9 -> Head 3 -> 10 -> 2 -> 1 -> 9 -> Head 10 -> 2 -> 1 -> 9 -> 3 -> Head 10 -> 2 -> 9 -> 3 -> Head 10 -> 2 -> 9 -> Head 3 -> 10 -> 2 -> 9 -> Head 3 -> 10 -> 2 -> Head 3 -> 10 -> Head

So this was the very easy python code for Circular Linked List. Hope you understood well 😆.

Enjoy (You can copy it for your assignment.)

John Veer

Contact mail id - john.veer.utube@gmail.com

Contact us for any query

Thanks for reading

print("Bye !")

www.basicpythonprogramme.blogspot.com