Deletion in Circular Doubly Linked List at End

by Online Tutorials Library July 22, 2022

Deletion in circular doubly linked list at end

There can be two scenario of deleting the first node in a circular doubly linked list.

The node which is to be deleted can be the only node present in the linked list. In this case, the condition head → next == head will become true, therefore the list needs to be completely deleted.

It can be simply done by assigning head pointer of the list to null and free the head pointer.

in the second scenario, the list contains more than one element in the list, therefore the condition head → next == head will become false. Now, reach the last node of the list and make a few pointer adjustments there. Run a while loop for this purpose

Now, temp will point to the node which is to be deleted from the list. Make the next pointer of previous node of temp, point to the head node of the list.

make the previous pointer of the head node, point to the previous node of temp.

Now, free the temp pointer to free the memory taken by the node.

in this way, the last node of the list is deleted.

Algorithm

Step 1: IF HEAD = NULL

Write UNDERFLOW
Go to Step 8
[END OF IF]

Step 2: SET TEMP = HEAD
Step 3: Repeat Step 4 while TEMP -> NEXT != HEAD
Step 4: SET TEMP = TEMP -> NEXT

[END OF LOOP]

Step 5: SET TEMP -> PREV -> NEXT = HEAD
Step 6: SET HEAD -> PREV = TEMP -> PREV
Step 7: FREE TEMP
Step 8: EXIT

C Function

  #include<stdio.h>  #include<stdlib.h>  void create(int);  void deletion_last();  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 lastn3.Exitn4.Enter your choice?”);  scanf(“%d”,&choice);  switch(choice)  {  case 1:  printf(“nEnter the itemn”);  scanf(“%d”,&item);  create(item);  break;   case 2:  deletion_last();  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));     struct node *temp;   if(ptr == NULL)     {         printf(“nOVERFLOWn”);     }     else     {          ptr->data=item;         if(head == NULL)         {             head = ptr;           ptr -> next = head;           ptr -> prev = head;          }         else         {            temp = head;            while(temp->next !=head)            {                temp = temp->next;            }            temp->next = ptr;            ptr ->prev=temp;            head -> prev = ptr;     ptr -> next = head;          }     }       printf(“nNode Insertedn”);  }  void deletion_last()  {     struct node *ptr;      if(head == NULL)  {  printf(“n UNDERFLOWn”);  }  else if(head->next == head)  {  head = NULL;   free(head);  printf(“nNode Deletedn”);  }  else   {  ptr = head;   if(ptr->next != head)  {  ptr = ptr -> next;   }  ptr -> prev -> next = head;  head -> prev = ptr -> prev;    free(ptr);  printf(“nNode Deletedn”);  }  }  

Output

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

Next TopicDoubly Linked List

Deletion in Circular Doubly Linked List at End

Deletion in circular doubly linked list at end

Algorithm

C Function

Why is internet continuously connecting and disconnecting

Difference between Apoptosis and Necrosis

You may also like