Deletion in Doubly Linked List at Beginning

by Online Tutorials Library July 22, 2022

Deletion at beginning

Deletion in doubly linked list at the beginning is the simplest operation. We just need to copy the head pointer to pointer ptr and shift the head pointer to its next.

now make the prev of this new head node point to NULL. This will be done by using the following statements.

Now free the pointer ptr by using the free function.

Algorithm

STEP 1: IF HEAD = NULL

WRITE UNDERFLOW
GOTO STEP 6

STEP 2: SET PTR = HEAD
STEP 3: SET HEAD = HEAD → NEXT
STEP 4: SET HEAD → PREV = NULL
STEP 5: FREE PTR
STEP 6: EXIT

C Function

  #include<stdio.h>  #include<stdlib.h>  void create(int);  void beginning_delete();  struct node  {  int data;  struct node *next;  struct node *prev;  };  struct node *head;  void main ()  {  int choice,item;  do   {  printf(“1.Append Listn2.Delete node from beginningn3.Exitn4.Enter your choice?”);  scanf(“%d”,&choice);  switch(choice)  {  case 1:  printf(“nEnter the itemn”);  scanf(“%d”,&item);  create(item);  break;   case 2:  beginning_delete();  break;   case 3:  exit(0);  break;  default:  printf(“nPlease enter valid choicen”);  }    }while(choice != 3);  }  void create(int item)  {        struct node *ptr = (struct node *)malloc(sizeof(struct node));     if(ptr == NULL)     {         printf(“nOVERFLOWn”);     }     else     {                 if(head==NULL)     {         ptr->next = NULL;         ptr->prev=NULL;         ptr->data=item;         head=ptr;     }     else      {         ptr->data=item;printf(“nPress 0 to insert more ?n”);         ptr->prev=NULL;         ptr->next = head;         head->prev=ptr;         head=ptr;     }  printf(“nNode Insertedn”);  }       }  void beginning_delete()  {  struct node *ptr;      if(head == NULL)  {  printf(“n UNDERFLOWn”);  }  else if(head->next == NULL)  {  head = NULL;   free(head);  printf(“nNode Deletedn”);  }  else  {  ptr = head;  head = head -> next;  head -> prev = NULL;  free(ptr);  printf(“nNode Deletedn”);  }  }  

Output

1.Append List  2.Delete node from beginning  3.Exit  4.Enter your choice?1    Enter the item  12    Node Inserted  1.Append List  2.Delete node from beginning  3.Exit  4.Enter your choice?2    Node Deleted  1.Append List  2.Delete node from beginning  3.Exit  4.Enter your choice?

Next TopicDoubly Linked List

Deletion in Doubly Linked List at Beginning

Deletion at beginning

Algorithm

C Function

Why is internet continuously connecting and disconnecting

Difference between Apoptosis and Necrosis

You may also like