Traverse through the circular linked list starting from the head and print the data in each node.<\/span><\/p>\nvoid DisplayList() \r\n{\r\n \r\n struct node *disp = head;\r\n \t\r\n if(head != NULL) \r\n {\r\n \r\n while(disp -> next != disp) \r\n{ \r\n printf(\"(%d, ) \",disp -> data);\r\n disp = disp -> next;\r\n }\r\n }\r\n}<\/pre>\nSearch for a node in a doubly circular linked list<\/h3>\n
Traverse through the circular linked list starting from the head and compare data in each node with the search element. If found, return the location at which the element was found. If not found, return -1.<\/p>\n
int SearchElement(int se) \r\n{\r\n node *search = head;\r\n while(search != NULL && search -> data != se) \r\n{ \r\n search = search -> next;\r\n }\r\n return search;\r\n}<\/pre>\nCircular Linked list implementation in C<\/h3>\n#include <stdio.h>\r\n#include <stdlib.h>\r\n \r\nstruct Node\r\n {\r\n int data;\r\n struct Node* next;\r\n};\r\n \r\nint main()\r\n{\r\n struct Node* Node1 = NULL;\r\n struct Node* Node2 = NULL;\r\n struct Node* Node3 = NULL;\r\n struct Node* head = Node1;\r\n \r\n \r\n Node1 = (struct Node*)malloc(sizeof(struct Node));\r\n Node2 = (struct Node*)malloc(sizeof(struct Node));\r\n Node3 = (struct Node*)malloc(sizeof(struct Node));\r\n \r\n \r\n Node1 -> data = 1; \r\n Node1 -> next = Node2; \r\n \r\n Node2 -> data = 2;\r\n Node2 -> next = Node3;\r\n \r\n \r\n Node3 -> data = 3; \r\n Node3 -> next = Node1;\r\n \r\n display(Node1);\r\n return 0;\r\n}\r\n\r\nvoid display(struct Node* disp)\r\n{\r\n do\r\n{\r\n printf(\" %d \", disp -> data);\r\n disp = disp -> next;\r\n }while (disp != head) ;\r\n}<\/pre>\nCircular Linked list implementation in Python<\/h3>\nclass Node:\r\n def __init__(self, data):\r\n self.data = data \r\n self.next = None \r\n \r\nclass SinglyLinkedList: \r\n def __init__(self):\r\n self.head = None\r\n \r\n def DisplayList(self):\r\n temp = self.head\r\n while (temp):\r\n print (temp.data)\r\n temp = temp.next\r\n \r\nif __name__=='__main__':\r\n \r\n sll = SinglyLinkedList()\r\n \r\n sll.head = Node(\u201cDATA\u201d)\r\n Node2 = Node(\u201cFLAIR\u201d)\r\n Node3 = Node(\u201cCLL\u201d)\r\n \r\n sll.head.next = Node2; \r\n Node2.next = Node3; \r\n Node3.next = head;\r\n \r\n llist.DisplayList()<\/pre>\nImplementation of Circular Linked list in C++<\/h3>\n#include <bits\/stdc++.h>\r\nusing namespace std;\r\n \r\nclass Node {\r\npublic:\r\n string data;\r\n Node* next;\r\n};\r\n \r\nvoid displayList(Node* n)\r\n{\r\n while (n != NULL)\r\n {\r\n cout << n -> data << \" \";\r\n n = n -> next;\r\n }\r\n}\r\n \r\nint main()\r\n{\r\n Node* Node1 = NULL;\r\n Node* Node2 = NULL;\r\n Node* Node3 = NULL;\r\n \r\n Node1 = new Node();\r\n Node2 = new Node();\r\n Node3 = new Node();\r\n \r\n Node1 -> data = \u201dDATA\u201d ; \r\n Node1 -> next = Node2; \r\n \r\n Node2 -> data = \u201cFLAIR\u201d; \r\n Node2 -> next = Node3;\r\n \r\n Node3 -> data = \u201cCLL\u201d; \r\n Node3 -> next = Node1;\r\n \r\n displayList(Node1);\r\n \r\n return 0;\r\n}<\/pre>\nCircular Linked list implementation in Java<\/h3>\nclass CircularLinkedList\r\n {\r\n \r\nNode head; \r\n \r\n static class Node\r\n {\r\n String data;\r\n Node next;\r\n \r\n Node(String d)\r\n {\r\n data = d;\r\n next = null;\r\n } \r\n }\r\n \r\n \r\n public void DisplayList()\r\n {\r\n Node n = head;\r\n do\r\n{\r\n System.out.print(n.data + \" \");\r\n n = n.next;\r\n }while (n != head) ;\r\n \r\n \r\n \r\n }\r\n \r\n public static void main(String[] args)\r\n {\r\n \r\n CircularLinkedList cllist = new CircularLinkedList();\r\n \r\n Node Node1 = new Node(\"DATA\");\r\n cllist.head = Node1;\r\n Node Node2 = new Node(\"FLAIR\");\r\n Node Node3 = new Node(\"CLL\");\r\n \r\n cllist.head.next = Node2; \r\n Node2.next = Node3;\r\n Node3.next = Node1;\r\n \r\n cllist.DisplayList();\r\n }\r\n}<\/pre>\nAdvantages of Circular Linked List<\/h3>\n\n- We can consider any node as a starting point. The whole linked list is traversable from any starting point.<\/span><\/li>\n
- The time complexity for jumping from the first node to last or last to first in a doubly circular linked list is constant<\/span><\/li>\n
- We don\u2019t need two different pointers for moving forward and backward. We can always reach the backward node by moving forward since it is a loop.<\/span><\/li>\n<\/ul>\n
Applications of Circular Linked list<\/h3>\n\n- All applications are put in a circular list on our personal computers. The operating system gives fixed time to each process for execution. It keeps on traversing through the list until all processes are executed.<\/span><\/li>\n
- Circular linked lists are used in creating a circular queue.<\/span><\/li>\n
- In multiplayer games like ludo king, all players are stored in a circular list and the pointer keeps on moving after each player\u2019s chance.<\/span><\/li>\n
- Doubly circular linked lists are very useful in the implementation of advanced data structures like the Fibonacci heap.<\/span><\/li>\n<\/ul>\n
Conclusion<\/h3>\n
With this article, we end our discussion of linked lists. We now understand different types of linked lists and how to perform commonly used operations on them.<\/p>\n
Linked lists are basic examples of Dynamic programming. In future articles, we will learn about other Data Structures that are implemented using a linked list.<\/p>\n","protected":false},"excerpt":{"rendered":"
In previous articles, singly-linked lists and doubly-linked lists are explained in detail. Here we will be focusing on the circular linked list and its modified versions. Circular linked lists are a modified version of...<\/p>\n","protected":false},"author":1,"featured_media":95454,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[24020],"tags":[24347,24345,2517,24343,24346],"class_list":["post-95296","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-data-structure-tutorials","tag-advantages-of-circular-linked-list","tag-applications-of-circular-linked-list","tag-circular-linked-list","tag-circular-linked-list-in-data-structure","tag-doubly-circular-linked-list"],"yoast_head":"\n
Circular Linked List in Data Structure - DataFlair<\/title>\n<meta name=\"description\" content=\"Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Learn more about it.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Circular Linked List in Data Structure - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Learn more about it.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2021-05-28T03:30:49+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"628\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"10 minutes\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Circular Linked List in Data Structure - DataFlair","description":"Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Learn more about it.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/","og_locale":"en_US","og_type":"article","og_title":"Circular Linked List in Data Structure - DataFlair","og_description":"Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Learn more about it.","og_url":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2021-05-28T03:30:49+00:00","og_image":[{"width":1200,"height":628,"url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg","type":"image\/jpeg"}],"author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"10 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/b49855299264df5e27e3ec6c2cd9fde9"},"headline":"Circular Linked List in Data Structure","datePublished":"2021-05-28T03:30:49+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/"},"wordCount":983,"commentCount":1,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#primaryimage"},"thumbnailUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg","keywords":["Advantages of Circular Linked list","Applications of Circular Linked list","Circular Linked List","Circular Linked List in data Structure","Doubly Circular Linked List"],"articleSection":["Data Structure Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/","url":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/","name":"Circular Linked List in Data Structure - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"primaryImageOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#primaryimage"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#primaryimage"},"thumbnailUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg","datePublished":"2021-05-28T03:30:49+00:00","description":"Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Learn more about it.","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#primaryimage","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-in-DS-1.jpg","width":1200,"height":628,"caption":"Circular linked list in Data Structure"},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-data-structure\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"Data Structure Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/data-structure-tutorials\/"},{"@type":"ListItem","position":3,"name":"Circular Linked List in Data Structure"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/b49855299264df5e27e3ec6c2cd9fde9","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team is a group of passionate educators and industry experts dedicated to providing high-quality online learning resources on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. With years of experience in the field, the team aims to simplify complex topics and help learners advance their careers. At DataFlair, we believe in empowering students and professionals with the knowledge and skills needed to thrive in today\u2019s fast-paced tech industry. Follow us for Free courses, expert insights, tutorials, and practical tips to boost your learning journey.","url":"https:\/\/data-flair.training\/blogs\/author\/datafbdad\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/95296","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=95296"}],"version-history":[{"count":5,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/95296\/revisions"}],"predecessor-version":[{"id":95466,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/95296\/revisions\/95466"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media\/95454"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=95296"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=95296"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=95296"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![\"Circular](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-normal-image01.jpg\")
<\/a><\/p>\n![\"Insert](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Circular-linked-list-normal-image02.jpg\")
<\/a><\/p>\n