Circular Doubly Linked List Circular doubly linked list is a more complexed type of data structure in which a node contain pointers to its previous node as well as the next node. A linked list is called circular if it is not NULL-terminated and all nodes are connected in the form of a cycle. Circular Linked List In single linked list, every node points to its next node in the sequence and the last node points NULL. Disadvantages: 1. Below is an example of a circular linked list. 4) Circular linked list implemented with the doubly linked list is used to create advanced data structure like Fibonacci Heap. It can be a singly circular linked list and doubly circular linked list like linked list. There is no null at the end in it. But in double linked list, we will have to go through in between nodes. It is not easy to reverse the linked list. 3. Disadvantages of circular linked list. Implementing a circular linked list is very complex compared to its other variants. - data structure tutorial. An empty linked list is considered as circular. A circular linked list is a linked list in which the last node points to the first node. Circular doubly linked list doesn't contain NULL in any of the node. If proper care is not taken, then the problem of infinite loop can occur. 2. Reversing it also is In fact, circular doubly linked lists discussed below can even eliminate the need for a full-length traversal to locate an element. If no, then press on the links below to learn about linked lists before reading this post on What is Circular Linked list ? The circular linked list is a type of linked list in which the last node references to the head of the list and the traversal is unidirectional. The nodes are not stored in contiguous memory locations and the reference field is a pointer which points to the next node in the list. Circular linked list This is a type of linked list in which the last node points to the starting node. Circular Linked List So as we can see the in circular linked list last node in the list is not pointing to null but its pointing the first node in the linked list and this makes a circle that is why it is called “Circular Linked List”. Circular linked list also performs all regular functions of a singly linked list. Let’s see how the Node structure will look like Prerequisites are that you must have basic knowledge of linked lists.