Open In App
Related Articles

Python program to Search an Element in a Circular Linked List

Improve Article
Save Article
Like Article

A linked list is a kind of linear data structure where each node has a data part and an address part which points to the next node. A circular linked list is a type of linked list where the last node points to the first one, making a circle of nodes.


Input: CList = 6->5->4->3->2, find = 3
Output: Element is present
Input: CList = 6->5->4->3->2, find = 1
Output: Element is not present

Search an Element in a Circular Linked List

For example, if the key to be searched is 30 and the linked list is 5->4->3->2, then the function should return false. If the key to be searched is 4, then the function should return true. 


  1. Initialize a node pointer, temp = head.
  2. Initialize a counter f=0 (to check if the element is present in a linked list or not).
  3. If the head is null then the print list is empty.
  4. Else start traversing the Linked List and if element found in Linked List increment in f.
  5. If the counter is zero, then the print element is not found.
  6. Else print element is present.

Below is the implementation of the above approach:


# Python program to Search an Element
# in a Circular Linked List
# Class to define node of the linked list    
class Node: 
    def __init__(self,data):    = data; = None;
class CircularLinkedList:
    # Declaring Circular Linked List
    def __init__(self):    
        self.head = Node(None);    
        self.tail = Node(None);    = self.tail;    = self.head;    
    # Adds new nodes to the Circular Linked List
    def add(self,data):    
        # Declares a new node to be added
        newNode = Node(data); 
        # Checks if the Circular
        # Linked List is empty
        if is None:
            # If list is empty then new node
            # will be the first node
            # to be added in the Circular Linked List
            self.head = newNode;
            self.tail = newNode;
   = self.head;
            # If a node is already present then
            # tail of the last node will point to
            # new node
   = newNode;
            # New node will become new tail
            self.tail = newNode;
            # New Tail will point to the head
   = self.head;    
    # Function to search the element in the 
    # Circular Linked List
    def findNode(self,element):
        # Pointing the head to start the search
        current = self.head;
        i = 1;
        # Declaring f = 0
        f = 0;    
        # Check if the list is empty or not    
        if(self.head == None):
            print("Empty list"); 
                # Comparing the elements
                # of each node to the
                # element to be searched
                if( ==  element): 
                    # If the element is present
                    # then incrementing f
                    f += 1;    
                # Jumping to next node
                current =;    
                i = i + 1;    
                # If we reach the head
                # again then element is not 
                # present in the list so 
                # we will break the loop
                if(current == self.head):    
            # Checking the value of f
            if(f > 0):    
                print("element is present");    
                print("element is not present");    
# Driver Code
if __name__ == '__main__':
    # Creating a Circular Linked List
    Circular Linked List we will be working on:
    1 -> 2 -> 3 -> 4 -> 5 -> 6
    circularLinkedList = CircularLinkedList();
    #Adding nodes to the list    
    # Searching for node 2 in the list    
    #Searching for node in the list    


element is present
element is not present

Time Complexity: O(N), where N is the length of the Circular linked list.

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 18 May, 2022
Like Article
Save Article
Similar Reads
Related Tutorials