C Data Structures - Doubly Linked List Other Related Topics

C - Delete all nodes of the Doubly Linked List



Deleting all nodes of a doubly linked list requires traverse through the list and deleting each node one by one. It requires creating a temp node pointing to the head then move the head to head next. After that delete the temp node. Repeat the process till the head becomes null.

The function deleteAllNodes is created for this purpose. It is a 2-step process.

void deleteAllNodes(struct Node** head_ref) {
  
  //1. create a temp node
  struct Node* temp;

  //2. if the head is not null make temp as head and 
  //   move head to head next, then delete the temp,
  //   continue the process till head becomes null
  while (*head_ref != NULL) {
    temp = *head_ref;
    *head_ref = (*head_ref)->next;
    free(temp);    
  }
  
  printf("All nodes are deleted successfully.\n");     
}

The below is a complete program that uses above discussed concept of deleting all nodes of a doubly linked list which makes the list empty with size zero.

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

//node structure
struct Node {
  int data;
  struct Node* next;
  struct Node* prev;
};

//Add new element at the end of the list
void push_back(struct Node** head_ref, int newElement) {  
  struct Node *newNode, *temp;
  newNode = (struct Node*)malloc(sizeof(struct Node)); 
  newNode->data = newElement;  
  newNode->next = NULL;
  newNode->prev = NULL;
  if(*head_ref == NULL) {
    *head_ref = newNode;
  } else {
    temp = *head_ref;
    while(temp->next != NULL) {
      temp = temp->next;
    }    
    temp->next = newNode;
    newNode->prev = temp;
  }
}

//delete all nodes of the list
void deleteAllNodes(struct Node** head_ref) {
  struct Node* temp;
  while (*head_ref != NULL) {
    temp = *head_ref;
    *head_ref = (*head_ref)->next;
    free(temp);    
  }  
  printf("All nodes are deleted successfully.\n");
}

//display the content of the list
void PrintList(struct Node* head_ref) {
  struct Node* temp = head_ref;
  if(head_ref != NULL) {
    printf("The list contains: ");
    while (temp != NULL) {
      printf("%i ",temp->data);
      temp = temp->next;  
    }
    printf("\n");
  } else {
    printf("The list is empty.\n");
  }   
}

// test the code 
int main() {
  struct Node* MyList = NULL;

  //Add four elements in the list.
  push_back(&MyList, 10);
  push_back(&MyList, 20);
  push_back(&MyList, 30);
  push_back(&MyList, 40);

  //Display the content of the list.
  PrintList(MyList);

  //delete all nodes of the list
  deleteAllNodes(&MyList);

  //Display the content of the list.
  PrintList(MyList);

  return 0; 
}

The above code will give the following output:

The list contains: 10 20 30 40 
All nodes are deleted successfully.
The list is empty.

5