Python - Circular Singly Linked List
A circular singly linked list is a linear data structure, in which the elements are stored in the form of a node. Each node contains two sub-elements. A data part that stores the value of the element and the next part that stores the link to the next node as shown in the below image:
The first node also known as HEAD is always used as a reference to traverse the list. The last node points to HEAD. A circular singly linked list can be visualized as a chain of nodes, where every node points to the next node. Along with this, next of the last node is linked to the head node.
Implementation of Circular Singly Linked List
Representation:
In Python, circular singly linked list can be represented as a class and a Node as a separate class. The LinkedList class contains a reference of Node class type.
# node structure class Node: #constructor to create a new node def __init__(self, data): self.data = data self.next = None #class Linked List class LinkedList: #constructor to create an empty LinkedList def __init__(self): self.head = None
Create a Circular Singly Linked List
Let us create a simple circular singly linked list which contains three data nodes.
# node structure class Node: #constructor to create a new node def __init__(self, data): self.data = data self.next = None #class Linked List class LinkedList: #constructor to create an empty LinkedList def __init__(self): self.head = None # test the code # create an empty LinkedList MyList = LinkedList() #Add first node. first = Node(10) #linking with head node MyList.head = first #linking next of the node with head first.next = MyList.head #Add second node. second = Node(20) #linking with first node first.next = second #linking next of the node with head second.next = MyList.head #Add third node. third = Node(30) #linking with second node second.next = third #linking next of the node with head third.next = MyList.head
Traverse a Circular Singly Linked List
A circular singly linked list can be traversed from any node of the list using a temp node. Keep on moving the temp node to the next one and displaying its content. Stop the traversal, after reaching the starting node.
# node structure class Node: #constructor to create a new node def __init__(self, data): self.data = data self.next = None #class Linked List class LinkedList: #constructor to create an empty LinkedList def __init__(self): self.head = None #display the content of the list def PrintList(self): temp = self.head if(temp != None): print("The list contains:", end=" ") while (True): print(temp.data, end=" ") temp = temp.next if(temp == self.head): break print() else: print("The list is empty.") # test the code # create an empty LinkedList MyList = LinkedList() #Add first node. first = Node(10) #linking with head node MyList.head = first #linking next of the node with head first.next = MyList.head #Add second node. second = Node(20) #linking with first node first.next = second #linking next of the node with head second.next = MyList.head #Add third node. third = Node(30) #linking with second node second.next = third #linking next of the node with head third.next = MyList.head #print the content of list MyList.PrintList()
The above code will give the following output:
The list contains: 10 20 30