Delete a node in a Doubly Linked List

Write a function to delete a given node in a doubly linked list.

     (a) Original Doubly Linked List  


     (a) After deletion of head node  


     (a) After deletion of middle node  


     (a) After deletion of last node  



Algorithm
Let the node to be deleted is del.
1) If node to be deleted is head node, then change the head pointer to next current head.
2) Set next of previous to del, if previous to del exixts.
3) Set prev of next to del, if next to del exixts.

#include <stdio.h>
#include <stdlib.h>

/* a node of the doubly linked list */
struct node
{
  int data;
  struct node *next;
  struct node *prev;
};

/* Function to delete a node in a Doubly Linked List.
   head_ref --> pointer to head node pointer.
   del  -->  pointer to node to be deleted. */
void deleteNode(struct node **head_ref, struct node *del)
{
  /* base case */
  if(*head_ref == NULL || del == NULL)
    return;

  /* If node to be deleted is head node */
  if(*head_ref == del)
    *head_ref = del->next;

  /* Change next only if node to be deleted is NOT the last node */
  if(del->next != NULL)
    del->next->prev = del->prev;

  /* Change prev only if node to be deleted is NOT the first node */
  if(del->prev != NULL)
    del->prev->next = del->next;     

  /* Finally, free the memory occupied by del*/
  free(del);
  return;
}     

/* UTILITY FUNCTIONS */
/* Function to insert a node at the beginning of the Doubly Linked List */
void push(struct node** head_ref, int new_data)
{
  /* allocate node */
  struct node* new_node =
       (struct node*) malloc(sizeof(struct node));

  /* put in the data  */
  new_node->data  = new_data;

  /* since we are adding at the begining,
    prev is always NULL */
  new_node->prev = NULL;

  /* link the old list off the new node */
  new_node->next = (*head_ref);    

  /* change prev of head node to new node */
  if((*head_ref) !=  NULL)
   (*head_ref)->prev = new_node ;    

  /* move the head to point to the new node */
   (*head_ref)    = new_node;
}

/* Function to print nodes in a given doubly linked list
   This function is same as printList() of singly linked lsit */
void printList(struct node *node)
{
  while(node!=NULL)
  {
   printf("%d ", node->data);
   node = node->next;
  }
}

/* Drier program to test above functions*/
int main()
{
  /* Start with the empty list */
  struct node* head = NULL;

  /* Let us create the doubly linked list 10<->8<->4<->2 */
  push(&head, 2);
  push(&head, 4);
  push(&head, 8);
  push(&head, 10);

  printf("\n Original Linked list ");
  printList(head);

  /* delete nodes from the doubly linked list */
  deleteNode(&head, head);  /*delete first node*/
  deleteNode(&head, head->next);  /*delete middle node*/
  deleteNode(&head, head->next);  /*delete last node*/

  /* Modified linked list will be NULL<-8->NULL */
  printf("\n Modified Linked list ");
  printList(head);           

  getchar();
}

Time Complexity: O(1)
Time Complexity: O(1)

Please write comments if you find any of the above codes/algorithms incorrect, or find better ways to solve the same problem.





  • ronny

    @geeksforgeeks @kartik @venki @sandeep @kartik

    In case of deleting the last node, shouldn’t the next of second last element be changed to NULL. Since it is still pointing the last element which is being freed. So isn’t this a case of DANGLING POINTER.

    Similarly for case of deleting the first node, shouldn’t the prev of second element be made NULL for the above said reasons.

    This can be done by removing the if conditions in the method.
    Correct me if I am wrong.

    • ronny

      @geeksforgeeks
      Sorry for the previoius comment.
      I misread the function.
      So i apologize for any inconvenience hereby caused.
      I shall be more careful before posting any comment in future.

  • ashatm

    when we are making the linked list ourselves and then we need to delete a node, how do we obtain the pointer to the node that is to be deleted, i.e., how do we get *del?

  • himank

    i neeed algo of this ………….

  • sagar patni

    #include”dll.h”
    #include
    #include
    void remove1(node *q,dll *l);
    void init(dll *l)
    {
    l->head=l->tail=NULL;
    }

    void append(dll *l ,int x)
    {
    node *p,*q;
    p=(node*)malloc(sizeof(node));
    p->val=x;
    p->next=p->pre=NULL;
    if(l->head==NULL)
    {
    l->head=l->tail=p;
    return;
    }
    p->pre=l->tail;
    l->tail->next=p;
    l->tail=p;
    }

    void traverse(dll *l)
    {
    node *p;
    p=l->head;
    printf(“[“);
    while(p!=NULL)
    {
    printf(“%d “,p->val);
    p=p->next;
    }
    printf(“]”);
    }

    void delodds(dll *l)
    {
    node *p,*q;
    p=l->head;
    while(p!=NULL)
    {
    if((p->val)%2!=0)
    { q=p;
    remove1(q,l);
    }
    p=p->next;
    }
    return;
    }

    void remove1(node *q,dll *l)
    { node *r,*s;
    if(q==l->head)
    { if(q==l->tail)
    { l->head=l->tail=NULL;
    free(q);
    return;
    }
    r=q->next;
    r->pre=NULL;
    l->head=r;
    free(q);
    return;
    }
    else if(q==l->tail)
    {
    r=q->pre;
    r->next=NULL;
    l->tail=r;
    free(q);
    return;
    }
    r=q->next;
    s=q->pre;
    s->next=q->next;
    r->pre=q->pre;
    free(q);
    }

  • sagar patni
     
    /* Paste your code here (You may delete these lines if not writing code) */#include"dll.h"
    #include<stdio.h>
    #include<stdlib.h>
    void remove1(node *q,dll *l);
    void init(dll *l)
    {
    	l->head=l->tail=NULL;
    }
    
    void append(dll *l ,int x)
    {
    	node *p,*q;
    	p=(node*)malloc(sizeof(node));
    	p->val=x;
    	p->next=p->pre=NULL;
    	if(l->head==NULL)
    	{
    		l->head=l->tail=p;
    		return;
    	}
    	p->pre=l->tail;
    	l->tail->next=p;
    	l->tail=p;
    }
    
    void traverse(dll *l)
    {
    	node *p;
    	p=l->head;
    	printf("[");
    	while(p!=NULL)
    	{
    		printf("%d ",p->val);
    		p=p->next;
    	}
    	printf("]");
    }
    
    void delodds(dll *l)
    {
    	node *p,*q;
    	p=l->head;
    	while(p!=NULL)
    	{
    		if((p->val)%2!=0)	
    		{	q=p;			
    			remove1(q,l);
    		}
    		p=p->next;
    	}
    	return;
    }
    
    void remove1(node *q,dll *l)
    {	node *r,*s;		
    	if(q==l->head)
    	{	if(q==l->tail)
    		{	l->head=l->tail=NULL;
    			free(q);
    			return;
    		}
    		r=q->next;
    		r->pre=NULL;
    		l->head=r;
    		free(q);
    		return;	
    	}
    	else if(q==l->tail)
    	{
    		r=q->pre;
    		r->next=NULL;
    		l->tail=r;
    		free(q);
    		return;
    	}
    	r=q->next;
    	s=q->pre;
    	s->next=q->next;
    	r->pre=q->pre;
    	free(q);
    }			
    
    
     
  • Mohamed

    Great examples, nicely implemented thank you!

  • Dreamer

    You have not covered the case.. if node is to be deleted is the last node..

    Also u could have bit more simplified in terms of cases.. if node to be deleted is
    1 Head node
    2 Last node
    3 Else..

    • Sandeep

      @Dreamer: I believe that case of last node is covered and demonstrated with an example.

      Could you provide the simplified code that handles all cases?