header linked lists header linked list is special type of linked list which contains header node at the beginning of the list soin header linked liststart will not point to the first node of the list but start will contain the address of the header node the following are the two variants of header linked listgrounded header linked list which stores null in the next field of the last node circular header linked list which stores the address of the header node in the next field of the last node herethe header node will denote the end of the list look at fig which shows both the types of header linked lists header node start header node start figure header linked list as in other linked listsif start nullthen this denotes an empty header linked list let us see how grounded header linked list is stored in the memory in grounded header start linked lista node has two fieldsdata and next the data field will store the information part and the next field will store the address of the node in sequence consider fig note that start stores the address of the header node the shaded row denotes header node the next field of the header - node stores the address of the first node of the list this node figure memory representation of stores the corresponding next field stores the address of the header linked list next nodewhich is sowe will look at address to fetch next data the next data item hencewe see that the first node can be accessed by writing first_node start -next and not by writing start first_ start node this is because start points to the header node and the header node points to the first node of the header linked list let us now see how circular header linked list is stored in the memory look at fig note that the last node in this case stores the address of the header node (instead of - figure memory representation of hencewe see that the first node can be circular header linked list accessed by writing first_node start -next and not writing start first_node this step set ptr start -next is because start points to the header node and step repeat steps and while ptr !start the header node points to the first node of the step apply process to ptr -data header linked list step set ptr ptr -next let us quickly look at figs and [end of loopstep exit that show the algorithms to traverse circular header linked listinsert new node in itand figure algorithm to traverse circular header linked list delete an existing node from it data next