{"id":27013,"date":"2018-01-02T21:34:21","date_gmt":"2018-01-02T16:04:21","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27013"},"modified":"2018-01-02T21:34:21","modified_gmt":"2018-01-02T16:04:21","slug":"doubly-linked-list-introduction-insertion","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/doubly-linked-list-introduction-insertion\/","title":{"rendered":"Doubly Linked List | Set 1 (Introduction and Insertion)"},"content":{"rendered":"

A D<\/strong>oubly L<\/strong>inked L<\/strong>ist (DLL) contains an extra pointer, typically called previous pointer<\/em>, together with next pointer and data which are there in singly linked list.<\/p>\n

\"Doubly<\/p>\n

Following is representation of a DLL node in C language.<\/p>\n

<\/div> 
\/* Node of a doubly linked list *\/struct node{  int data;  struct node *next; \/\/ Pointer to next node in DLL  struct node *prev; \/\/ Pointer to previous node in DLL};<\/code><\/pre> <\/div>\n
 <\/p>\n
Following are advantages\/disadvantages of doubly linked list over singly linked list.<\/p>\n
Advantages over singly linked list<\/strong>
\n1)<\/strong> A DLL can be traversed in both forward and backward direction.
\n2)<\/strong> The delete operation in DLL is more efficient if pointer to the node to be deleted is given.
\nIn singly linked list, to delete a node, pointer to the previous node is needed. To get this previous node, sometimes the list is traversed. In DLL, we can get the previous node using previous pointer.<\/p>\n
Disadvantages over singly linked list<\/strong>
\n1)<\/strong> Every node of DLL Require extra space for an previous pointer. It is possible to implement DLL with single pointer though (See this <\/a>and this<\/a>).
\n2)<\/strong> All operations require an extra pointer previous to be maintained. For example, in insertion, we need to modify previous pointers together with next pointers. For example in following functions for insertions at different positions, we need 1 or 2 extra steps to set previous pointer.<\/p>\n
Insertion<\/strong>
\nA node can be added in four ways
\n1) <\/strong>At the front of the DLL
\n2)<\/strong> After a given node.
\n3)<\/strong> At the end of the DLL
\n4)<\/strong> Before a given node.<\/p>\n[ad type=”banner”]\n
1) Add a node at the front: (A 5 steps process)<\/strong>
\nThe new node is always added before the head of the given Linked List. And newly added node becomes the new head of DLL. For example if the given Linked List is 10152025 and we add an item 5 at the front, then the Linked List becomes 510152025. Let us call the function that adds at the front of the list is push(). The push() must receive a pointer to the head pointer, because push must change the head pointer to point to the new node (See this<\/a>)<\/p>\n
\"Doubly<\/p>\n
Following are the 5 steps to add node at the front.<\/p>\n
 
 <\/div> 
\/* Given a reference (pointer to pointer) to the head of a list   and an int, inserts a new node on the front of the list. *\/void push(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. Make next of new node as head and previous as NULL *\/    new_node->next = (*head_ref);    new_node->prev = NULL;     \/* 4. change prev of head node to new node *\/    if((*head_ref) !=  NULL)      (*head_ref)->prev = new_node ;     \/* 5. move the head to point to the new node *\/    (*head_ref)    = new_node;}<\/code><\/pre> <\/div>\n
 <\/p>\n
2) Add a node after a given node.: (A 7 steps process)<\/strong>
\nWe are given pointer to a node as prev_node, and the new node is inserted after the given node.<\/p>\n
\"Doubly<\/p>\n
 
 <\/div> 
\/* Given a node as prev_node, insert a new node after the given node *\/void insertAfter(struct node* prev_node, int new_data){    \/*1. check if the given prev_node is NULL *\/    if (prev_node == NULL)    {        printf("the given previous node cannot be NULL");        return;    }     \/* 2. allocate new node *\/    struct node* new_node =(struct node*) malloc(sizeof(struct node));     \/* 3. put in the data  *\/    new_node->data  = new_data;     \/* 4. Make next of new node as next of prev_node *\/    new_node->next = prev_node->next;     \/* 5. Make the next of prev_node as new_node *\/    prev_node->next = new_node;     \/* 6. Make prev_node as previous of new_node *\/    new_node->prev = prev_node;     \/* 7. Change previous of new_node's next node *\/    if (new_node->next != NULL)      new_node->next->prev = new_node;}<\/code><\/pre> <\/div>\n
 <\/p>\n
3) Add a node at the end: (7 steps process)<\/strong>
\nThe new node is always added after the last node of the given Linked List. For example if the given DLL is 510152025 and we add an item 30 at the end, then the DLL becomes 51015202530.
\nSince a Linked List is typically represented by the head of it, we have to traverse the list till end and then change the next of last node to new node.<\/p>\n
\"Doubly<\/p>\n
Following are the 7 steps to add node at the end<\/p>\n
 
 <\/div> 
\/* Given a reference (pointer to pointer) to the head   of a DLL and an int, appends a new node at the end  *\/void append(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     struct node *last = *head_ref;  \/* used in step 5*\/     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. This new node is going to be the last node, so          make next of it as NULL*\/    new_node->next = NULL;     \/* 4. If the Linked List is empty, then make the new          node as head *\/    if (*head_ref == NULL)    {        new_node->prev = NULL;        *head_ref = new_node;        return;    }     \/* 5. Else traverse till the last node *\/    while (last->next != NULL)        last = last->next;     \/* 6. Change the next of last node *\/    last->next = new_node;     \/* 7. Make last node as previous of new node *\/    new_node->prev = last;     return;}<\/code><\/pre> <\/div>\n
 <\/p>\n
4) Add a node before a given node<\/strong>
\nThis is left as an exercise for the readers.<\/p>\n
A complete working program to test above functions.<\/strong>
\nFollowing is complete C program to test above functions.<\/p>\n
C Programming:<\/p>\n
 
 <\/div> 
\/\/ A complete working C program to demonstrate all insertion methods#include <stdio.h>#include <stdlib.h> \/\/ A linked list nodestruct node{    int data;    struct node *next;    struct node *prev;}; \/* Given a reference (pointer to pointer) to the head of a list   and an int, inserts a new node on the front of the list. *\/void push(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. Make next of new node as head and previous as NULL *\/    new_node->next = (*head_ref);    new_node->prev = NULL;     \/* 4. change prev of head node to new node *\/    if((*head_ref) !=  NULL)      (*head_ref)->prev = new_node ;     \/* 5. move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Given a node as prev_node, insert a new node after the given node *\/void insertAfter(struct node* prev_node, int new_data){    \/*1. check if the given prev_node is NULL *\/    if (prev_node == NULL)    {        printf("the given previous node cannot be NULL");        return;    }     \/* 2. allocate new node *\/    struct node* new_node =(struct node*) malloc(sizeof(struct node));     \/* 3. put in the data  *\/    new_node->data  = new_data;     \/* 4. Make next of new node as next of prev_node *\/    new_node->next = prev_node->next;     \/* 5. Make the next of prev_node as new_node *\/    prev_node->next = new_node;     \/* 6. Make prev_node as previous of new_node *\/    new_node->prev = prev_node;     \/* 7. Change previous of new_node's next node *\/    if (new_node->next != NULL)      new_node->next->prev = new_node;} \/* Given a reference (pointer to pointer) to the head   of a DLL and an int, appends a new node at the end  *\/void append(struct node** head_ref, int new_data){    \/* 1. allocate node *\/    struct node* new_node = (struct node*) malloc(sizeof(struct node));     struct node *last = *head_ref;  \/* used in step 5*\/     \/* 2. put in the data  *\/    new_node->data  = new_data;     \/* 3. This new node is going to be the last node, so          make next of it as NULL*\/    new_node->next = NULL;     \/* 4. If the Linked List is empty, then make the new          node as head *\/    if (*head_ref == NULL)    {        new_node->prev = NULL;        *head_ref = new_node;        return;    }     \/* 5. Else traverse till the last node *\/    while (last->next != NULL)        last = last->next;     \/* 6. Change the next of last node *\/    last->next = new_node;     \/* 7. Make last node as previous of new node *\/    new_node->prev = last;     return;} \/\/ This function prints contents of linked list starting from the given nodevoid printList(struct node *node){    struct node *last;    printf("\\nTraversal in forward direction \\n");    while (node != NULL)    {        printf(" %d ", node->data);        last = node;        node = node->next;    }     printf("\\nTraversal in reverse direction \\n");    while (last != NULL)    {        printf(" %d ", last->data);        last = last->prev;    }} \/* Drier program to test above functions*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;     \/\/ Insert 6.  So linked list becomes 6->NULL    append(&head, 6);     \/\/ Insert 7 at the beginning. So linked list becomes 7->6->NULL    push(&head, 7);     \/\/ Insert 1 at the beginning. So linked list becomes 1->7->6->NULL    push(&head, 1);     \/\/ Insert 4 at the end. So linked list becomes 1->7->6->4->NULL    append(&head, 4);     \/\/ Insert 8, after 7. So linked list becomes 1->7->8->6->4->NULL    insertAfter(head->next, 8);     printf("Created DLL is: ");    printList(head);     getchar();    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/p>\n
 Created DLL is:\r\nTraversal in forward direction\r\n 1  7  8  6  4\r\nTraversal in reverse direction\r\n 4  6  8  7  1<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Doubly Linked List (Introduction and Insertion) – Doubly Linked List  – A Doubly Linked List (DLL) contains an extra pointer, typically called previous.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79479,79476],"tags":[80728,80725,80731,80730,80724,80726,80727,80729],"class_list":["post-27013","post","type-post","status-publish","format-standard","hentry","category-doubly-linked-list","category-linked-list","tag-algorithm-for-deletion-in-doubly-linked-list","tag-algorithm-to-insert-a-node-at-the-end-of-a-doubly-linked-list","tag-doubly-linked-list-algorithm-pdf","tag-doubly-linked-list-insertion","tag-doubly-linked-list-operations","tag-explain-transitive-and-reflexive-closure-of-a-graph","tag-insertion-and-deletion-in-doubly-linked-list-in-c-program","tag-what-is-circular-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27013","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27013"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27013\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27013"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27013"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27013"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
Six of the above 7 steps are same as the 6 steps used for inserting after a given node in singly linked list<\/a>. The one extra step is needed to change previous pointer of new node.<\/p>\n[ad type=”banner”]\n
Five of the above steps step process are same as the 5 steps used for inserting after a given node in singly linked list<\/a>. The two extra steps are needed to change previous pointer of new node and previous pointer of new node\u2019s next node.<\/p>\n[ad type=”banner”]\n
Four steps of the above five steps are same as the 4 steps used for inserting at the front in singly linked list<\/a>. The only extra step is to change previous of head.<\/p>\n[ad type=”banner”]\n