Question

Deletion after the specified node  in Doubly Linked List

Answer 1

Deletion after the specified node  in Doubly Linked List

Algorithm

Write UNDERFLOW    Go to Step 9   [END OF IF]    [END OF LOOP] Step 1: IF HEAD = NULL Step 2: SET TEMP = HEAD Step 3: Repeat Step 4 while TEMP -> DATA != ITEM Step 4: SET TEMP = TEMP -> NEXT Step 5: SET PTR = TEMP -> NEXT Step 6: SET TEMP -> NEXT = PTR -> NEXT Step 7: SET PTR -> NEXT -> PREV = TEMP Step 8: FREE PTR Step 9: EXIT

Program Code

#include<stdio.h>   #include<stdlib.h>   #include<conio.h> void create(int);   void delete_specified();   struct node   {       int data;       struct node *next;       struct node *prev;   };   struct node *head;   void main ()   {        clrscr();          int choice,item;       do        {           printf("1.Append List\n2.Delete node\n3.Exit\nEnter your choice: ");           scanf("%d",&choice);           switch(choice)           {               case 1:               printf("Enter the item: ");               scanf("%d",&item);               create(item);               break;                case 2:               delete_specified();               break;                case 3:               exit(0);               break;                 default:               printf("Please enter valid choice\n\n");           }              }while(choice != 3);   }   void create(int item)   {      struct node *ptr = (struct node *)malloc(sizeof(struct node));      if(ptr == NULL)      {          printf("OVERFLOW\n\n");      }      else      {      if(head==NULL)      {          ptr->next = NULL;          ptr->prev=NULL;          ptr->data=item;          head=ptr;      }      else       {          ptr->data=item;          ptr->prev=NULL;          ptr->next = head;          head->prev=ptr;          head=ptr;      }       printf("Node Inserted\n\n");   }         }   void delete_specified( )   {       struct node *ptr, *temp;        int val;        printf("Enter the value: ");       scanf("%d",&val);       temp = head;       while(temp -> data != val)       temp = temp -> next;       if(temp -> next == NULL)       {           printf("Can't delete\n\n");     }       else if(temp -> next -> next == NULL)       {           temp ->next = NULL;           printf("Node Deleted\n\n");       }       else     {         ptr = temp -> next;         temp -> next = ptr -> next;         ptr -> next -> prev = temp;         free(ptr);         printf("Node Deleted\n\n");     }      }

Output

---

For more Data Structures & Algorithms Tutorials Click here

---