advanced linked lists in we introduced the linked list data structure and saw how it can be used to improve the construction and management of lists for certain types of applications in that discussionwe limited the focus to the singly linked list in which traversals start at the front and progressone element at timein single direction but there are number of variations to the linked list structure based on how the nodes are linked and how many chains are constructed from those links in this we introduce some of the more common linked list variations the doubly linked list the singly linked list introduced in consists of nodes linked in single direction access and traversals begin with the first node and progress toward the last nodeone node at time but what if we want to traverse the nodes in reverse orderwith the singly linked listthis can be done but not efficiently we would have to perform multiple traversalswith each traversal starting at the front and stopping one node earlier than on the previous traversal or consider the problem in which you are given reference to specific node and need to insert new node immediately preceding that node since the predecessor of given node cannot be directly accessedwe would have to use modified insertion operation in which the list is traversed from the first node until the predecessor of the given node is found againthis is not an efficient solution for these operations and number of otherswe need direct access to both the node following and immediately preceding given node organization in doubly linked listeach node contains not only the data component and link to the next node as in the singly linked listbut also second link that points