![]() Each node is linked with its previous node using its previous pointer.Each node is linked with its next node using its next pointer. ![]() Each node carries a data and two pointer fields called next and prev.Doubly Linked List contains a pointer element called head.Next represents a pointer that points to next node in the list.Īs per the above illustration, the following are the important points to be considered.Previous represents a pointer that points to the previous node.Data represents the data value stored in the node.So, a typical node in the doubly linked list node consists of three fields: With the help of the previous pointer, the doubly linked list can be traversed in a backward direction thus making insertion and deletion operations easier to perform. The doubly linked list has overcome this limitation by providing an additional pointer that points to the previous node. One of the limitations of the singly linked list is that it can be traversed in only one direction that is forward. The first node of the linked list is called the head, and the last node of the list is called the tail of the list. Each node contains two fields: data and pointer to the next field. ![]() The linked list is a linear data structure that can be described as the collection of nodes. ![]() Doubly Linked List is a variation of the linked list. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |