Skip to main content

Doubly Linked List

Doubly Linked List is a list where each node has two links - one to the next node and another to the previous node.


Because of two links, operations on this list are considerably easier. But there is an overhead of one more pointer in each node.

First we need to have a node for the list. As I mentioned earlier, the node will have data - in this case a simple integer and two pointers.



 struct node  
 {  
   int n;  
   struct node *next;  
   struct node *prev;  
 };  
 typedef struct node * NODEPTR;

We have typedefined NODEPTR as we will be use it often.

Next we have to define two pointers - head of the list and tail of the list. And let us not forget to initialize them to NULL.


 int main()  
 {  
          NODEPTR head,tail;      
          head = tail = NULL;

Our create_node function will be similar to that of singly linked list. Only difference is we have to initialize newnode->prev as well. To NULL.

Let us write functions to insert a node to  list. Let us see two simple cases 
  • insert the node at the beginning of the list 
  • and append the node at the end of the list.

Insert node to DLL

 



As can be seen from the diagram, we should link the new node before the head node. 
  1. We just need to set head->prev to newnode 
  2. and newnode->next to head.
  3. And then set newnode to be head
But this will give us a problem when the list is empty viz head is null. head->prev gives segmentation fault. 

To avoid that we have to make a slight adjustment in our first step
  1. If head is not NULL set head->prev to newnode 
Now we are ready to write our insert_node function. Here is the function


 NODEPTR insert_node(NODEPTR head, NODEPTR newnode)  
 {  
    newnode->next = head;  
    if(head)  
    {  
      head->prev = newnode;  
    }  
    head = newnode;  
    return head;  
 }

Append node to DLL

 

Here we should add the new node to the end of DLL. So, we have to modify tail. 
  1. Set tail->next to newnode
  2. Set newnode->prev to tail
  3. Define newnode as tail
Again there will be a problem when tail is NULL. That is when the list is empty. So change our first step to
  1. Set tail->next to newnode if tail is not NULL


 NODEPTR append_node(NODEPTR tail, NODEPTR newnode)  
 {  
    if(tail!=NULL)//only if the list is non-empty
      tail->next = newnode;  
    newnode->prev = tail;  
    tail = newnode;  
    return tail;  
 }

DLL traversal  

 

Traversal of DLL is similar to that of SLL. But we can also traverse the nodes in reverse order, starting from last node.

void display_nodes_reverse(NODEPTR tail)  
 {  
   NODEPTR temp = tail;//redundant!
   while (temp!= NULL)  
   {  
     printf("%d====>",temp->n);  
     temp = temp->prev;  
   }  
 }

Here is our complete program 

#include<stdio.h>  
#include<stdlib.h>
 struct node  
 {  
   int n;  
   struct node *next;  
   struct node *prev;  
 };  
 typedef struct node * NODEPTR;  
 NODEPTR create_node(int value);  
 NODEPTR insert_node(NODEPTR head,NODEPTR newnode);  
 NODEPTR append_node(NODEPTR tail, NODEPTR newnode);  
 void display_nodes(NODEPTR head);  
 void display_nodes_reverse(NODEPTR tail); 

 NODEPTR create_node(int value)  
 {  
   NODEPTR temp = (NODEPTR) malloc(sizeof(struct node));  
   temp->prev = temp->next = NULL;  
   temp->n = value;  
   return temp;  
 } 

 NODEPTR insert_before_head(NODEPTR head, NODEPTR newnode)  
 {  
    newnode->next = head;  
    if(head)  
    {  
      head->prev = newnode;  
    }  
    head = newnode;  
    return head;  
 } 

 NODEPTR append_node(NODEPTR tail, NODEPTR newnode)  
 {  
    if(tail!=NULL)
     tail->next = newnode;  
    newnode->prev = tail;  
    tail = newnode;  
    return tail;  
 } 

void insert_after( NODEPTR*tailptr,NODEPTR newnode,NODEPTR n1)
{
        //add the node after n1
        NODEPTR n2 = n1->next;
        n1->next = newnode;
        newnode->prev = n1;
        newnode->next = n2;
        if (n2!=NULL)//if n1 is not the last node
        {
          n2->prev = newnode;
        }
        if(n1==(*tailptr))
        {
            *tailptr =  newnode;//adding after last node. Make newnode as tail
        }
} 

 void display_nodes(NODEPTR head)  
 {  
   NODEPTR temp = head;//redundant 
   while (temp!= NULL)  
   {  
     printf("%d====>",temp->n);  
     temp = temp->next;  
   }  
 } 

 void display_nodes_reverse(NODEPTR tail)  
 {  
   NODEPTR temp = tail;//redundant 
   while (temp!= NULL)  
   {  
     printf("%d====>",temp->n);  
     temp = temp->prev;  
   }  
 } 

 int main()  
 {  
     NODEPTR head,tail;  
     NODEPTR newnode;  
     int numnodes,i;  
     //initialize head and tail. Very important!!  
     head = tail = NULL;  
     printf("Number of nodes = ");  
     scanf("%d",&numnodes);  
     
     for(i = 0;i<numnodes/2;i++)  
     {  
       int value;  
       NODEPTR newnode;  
       printf("node value=");  
       scanf("%d",&value);  
       newnode = create_node(value);  
       tail = append_node(tail,newnode);
       if(head==NULL)  
       {  
          head = tail;  
       }  
     }  
     for( ;i<numnodes;i++)  
     {  
       int value;  
       NODEPTR newnode;  
       printf("node value=");  
       scanf("%d",&value);  
       newnode = create_node(value);  
       head = insert_before_head(head,newnode);
       if(tail==NULL)  
       {  
          tail = head;
       }  
     }  
     
     printf("The doubly linked list is ");  
     display_nodes(head);  
     printf("The doubly linked list in reverse is ");  
     display_nodes_reverse(tail);  
 }
 

Insert a node after a given node

We should also be able to add the node after any given node. Or insert the node before a given node. 

Let us look back at our diagram where we are adding a new node after n1.

 As can be seen from the diagram, we should insert the new node after n1. If n2 was the node next to n1, even this n2 should be linked to n1. 

The steps needed are
  1. n2 = n1->next i.e. get the node after n1
  2. n1->next = newnode
  3. newnode->prev = n1
  4. newnode->next = n2
  5. n2->prev = newnode
The special considerations as usual is when n1 is the last node in the list. In that case n2 will be null. Hence step 5 will give segmentation fault. So 5 should be changed to 

       5. if (n2!=NULL)   n2->prev = newnode

Another thing which should be taken care when inserting after last node is modifying the tail pointer. If we add a node after tail, this new node becomes tail. 

And also since C functions are call by value, our function should use pointer to tail. That is pointer to pointer to last node. 

Hence insert_after  function is 

 void insert_after( NODEPTR*tailptr,NODEPTR newnode,NODEPTR n1)  
 {  
     //add the node between n1 and n2  
     NODEPTR n2 = n1->next;  
     n1->next = newnode;  
     newnode->prev = n1;  
     newnode->next = n2;  
     if (n2!=NULL)//if n1 is not the last node  
     {  
      n2->prev = newnode;  
     }  
     if(n1==(*tailptr))  
     {  
       *tailptr = newnode;//adding after last node. Make newnode as tail  
     }  
 }  
 int main()  
 {  
  .......  
 insert_after( &tail,newnode,currnode);

Download the program used from here 


Labels:

Comments

Post a Comment

Popular posts from this blog

Introduction to AVL tree

AVL tree is a balanced binary search tree where the difference between heights of two sub trees is maximum 1. Why balanced tree A binary tree is good data structure because search operation here is of the order of O(logn). But this is true if the tree is balanced - which means the left and right subtrees are almost equal in height. If not balanced, search operation will take longer.  In worst case, if the tree has only one branch, then search is of the order O(n). Look at this example.  Here all nodes have only right children.  To search a value in this tree, we need upto 7 iterations, which is O(n). So this tree is very very inefficient. One way of making the tree efficient is to, balance the tree and make sure that height of two branches of each node are almost equal. Height of a node Height of a node is the distance between the node and its extreme child.  In the above a diagram, height of 37 is 3 and height of left child of 37 is 0 and right child of 37 is 2. Bal...
Post a Comment
Read more

Balanced brackets

Have you observed something? When ever you are writing code using any IDE, if you write mismatched brackets, immediately an error is shown by IDE. So how does IDE  know if an expression is having balanced brackets? For that, the expression must have equal number of opening and closing brackets of matching types and also they must be in correct order. Let us look at some examples (a+b)*c+d*{e+(f*g)}   - balanced (p+q*[r+u )] - unbalanced (p+q+r+s) ) - unbalanced (m+n*[p+q]+{g+h}) - balanced So we do we write a program to check if an expression is having balanced brackets? We do need to make use of stack to store the brackets. The algorithm is as follows Scan a character - ch from the expression If the character is opening bracket, push it to stack If the character is closing bracket pop a character from stack If popped opening bracket and ch are not of same type ( ( and ) or [ and ] ) stop the function and return false Repeat steps 2 and 3 till all characters are scanned. On...
2 comments
Read more

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more