data structures using return start/had to be added output *****main menu **** create list display the list add node at the beginning add the node at the end add the node before given node add the node after given node delete node from the beginning delete node from the end delete given node delete node after given node delete the entire list sort the list exit enter your option enter your option circular linked lists in circular linked listthe last node contains pointer to the first node of the list we can have circular singly linked list as well as circular doubly linked list while traversing circular linked listwe can begin at any node and traverse the list in any directionforward or backwarduntil we reach the same node where we started thusa circular linked list has no beginning and no ending figure shows circular linked list start figure circular linked list the only downside of circular linked list is the complexity of iteration note that there are no null values in the next part of any of the nodes of list circular linked lists are widely used in operating systems for task start maintenance we will now discuss an example where circular linked next data list is used when we are surfing the internetwe can use the back button and the forward button to move to the previous pages that we have already visited how is this donethe answer is simple circular linked list is used to maintain the sequence of the web pages visited traversing this circular linked list either in forward or backward direction helps to revisit the pages again using back and forward buttons actuallythis is done using either the circular stack or the circular queue we will read about circular queues in consider fig we can traverse the list until we find the next entry that contains the address of the first node of the list this denotes the end of the linked figure memory representation listthat isthe node that contains the address of the first node is actually of circular linked list