Define another class for creating a doubly linked list, and it has two nodes: head and tail.It will have three properties: data, previous which will point to the previous node and next which will point to the next node. Define a Node class which represents a node in the list.Node 5 represents the tail of the list whose previous pointer will point to node 4, and next will point to NULL. Next pointer of node one will point to node 2. The previous pointer of the head node will always point to NULL. Here, node 1 represents the head of the list. Next represents a pointer that points to next node in the list.Ībove picture represents a doubly linked list in which each node has two pointers to point to previous and next node respectively. Previous represents a pointer that points to the previous node. So, a typical node in the doubly linked list consists of three fields:ĭata represents the data value stored in the node. With the help of the previous pointer, the doubly linked list can be traversed in a backward direction thus making insertion and deletion operation 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 which can be described as the collection of nodes. In this program, we will create a doubly linked list and print all the nodes present in the list.ĭoubly Linked List is a variation of the linked list. Program to create and display a doubly linked list.
0 kommentar(er)
