output *****main menu **** create list display the list delete the entire list exit enter your option enter - to end enter the data enter the data enter the data enter the data- doubly linked list created enter your option circular doubly linked lists circular doubly linked list or circular two-way linked list is more complex type of linked list which contains pointer to the next as well as the previous node in the sequence the difference between doubly linked and circular doubly linked list is same as that exists between singly linked list and circular linked list the circular doubly linked list does not contain null in the previous field of the first node and the next field of the last node ratherthe next field of the last node stores the address of the first node of the listi start similarlythe previous field of the first field stores the address of the last node circular doubly linked list is shown in fig start figure circular doubly linked list since circular doubly linked list contains three parts in its structureit calls for more space per node and more expensive basic operations howevera circular doubly linked list provides the ease to manipulate the elements of the list as it maintains pointers to nodes in both the directions (forward and backwardthe main advantage of using circular doubly linked list is that it makes search operation twice as efficient let us view how circular doubly linked list is maintained in the start memory consider fig in the figurewe see that variable prev data next start is used to store the address of the first node here in this examplestart so the first data is stored at address which is since this is the first nodeit stores the address of the last node of the list in its previous field the corresponding next stores the address of the next nodewhich is sowe will look at address to fetch the next data item the previous field will contain the address of the first node the second data element obtained from address is we repeat this procedure until we reach position where the next entry stores the address of the first element of the list this denotes the end of the linked listthat isthe node that contains the address of the first node is actually the last node of figure memory representation of the list circular doubly linked list