Skip to main content

Deletion of last node in doubly link list

Now we will see how to delete node at last position in doubly link list.

Algorithm to delete node at last position in doubly link list:

  • Declare TEMP = START
  • If list have only one node i.e. START->NEXT = NULL
    • Set START = NULL
  • Else
    • Traverse the list for last node in the list into TEMP pointer
    • Set TEMP->PREV->NEXT = NULL
  • Free (TEMP)
  • End If;

Function to delete last node in doubly link list:

 

int deleteAtLast(NODE **start){
 NODE *temp = *start;
 int info = -1;
 if(*start == NULL){
  printf("\nError: No nodes");
 }
 else if((*start)->next == NULL){
  info = (*start)->info;
  free(*start);
  *start = NULL;
 }
 else{
  while(temp->next != NULL){
   temp = temp->next;
  }
  temp->prev->next = NULL;
  info = temp->info;
  free(temp);
 }
 return info;
}
 

Program to delete last node in the doubly link list:

 

#include <stdio.h>
#include <malloc.h>

typedef struct node{
 int info;
 struct node *next, *prev;
} NODE;

void insertAtLast(NODE **, int);
int deleteAtLast(NODE **);
void traverse(NODE **);

int main(){
 
 NODE *start = NULL;
 
 insertAtLast(&start, 1);
 insertAtLast(&start, 2);
 traverse(&start);
 
 deleteAtLast(&start);
 traverse(&start);
 
 deleteAtLast(&start);
 traverse(&start);
 
 deleteAtLast(&start);
 traverse(&start);
  
 return 0;
}

int deleteAtLast(NODE **start){
 NODE *temp = *start;
 int info = -1;
 if(*start == NULL){
  printf("\nError: No nodes");
 }
 else if((*start)->next == NULL){
  info = (*start)->info;
  free(*start);
  *start = NULL;
 }
 else{
  while(temp->next != NULL){
   temp = temp->next;
  }
  temp->prev->next = NULL;
  info = temp->info;
  free(temp);
 }
 return info;
}

void insertAtLast(NODE **start, int info){
 NODE *ptr = (NODE*) malloc(sizeof(NODE));
 NODE *temp = *start;
 ptr->info = info;
 ptr->next = NULL;
 if(*start == NULL){
  *start = ptr;
  ptr->prev = NULL;
 }
 else{
  while(temp->next != NULL){
   temp = temp->next;
  }
  ptr->prev = temp;
  temp->next = ptr;
 }
}

void traverse(NODE **start){
 NODE *temp = *start;
 while(temp != NULL){
  printf("%d  ", temp->info);
  temp = temp->next;
 }
 printf("\n");
}
 
1  2
1
Error: No nodes
 

Related topics:

Labels:

Comments

Post a Comment

Popular posts from this blog

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

Insert node at first position in circular link list

Insertion of new node at first position in circular link list requires creation of new node and setting it's info field. After creation of new node, we make last node points to newly created node and newly created node to the first node of the list. Let us see the algorithm for insertion : Algorithm for insertion at first position in circular link list: In this algorithm, TAIL is pointer to last node and PTR is node to be inserted at first. The step are as follows: Create new node PTR Set the INFO field of PTR If list have no node i.e. [TAIL == NULL] TAIL = PTR PTR->NEXT = PTR [PTR will point to itself] Else PTR->NEXT = TAIL->NEXT [PTR's next will point to first node] TAIL->NEXT = PTR [TAIL's next pointer will point to PTR] End If Function to insert node at first position in circular link list: void insertAtFirst(NODE **tail, int info){ NODE *ptr = (NODE*) malloc(sizeof(NODE)); ptr->info = info; if(*tail == NULL){ //no nodes in list ptr-...
Post a Comment
Read more