Write a C program to create a list of n nodes and delete all nodes of the given linked list. How to delete entire linked list in C. How to clear all nodes of a linked list. How to delete all nodes of a linked list. Algorithm to delete all nodes from singly linked list.
Required knowledge
Basic C programming, Functions, Singly Linked List, Dynamic memory allocation
Algorithm to delete all nodes of Singly Linked List
Algorithm to delete all nodes of a Singly Linked List %%Input : head node of the linked list Begin: While (head != NULL) do temp ← head head ← head.next unalloc (temp) End while End
Program to delete all nodes of Singly Linked List
/** * C program to delete all nodes of Singly Linked List */ #include <stdio.h> #include <stdlib.h> /* Structure of a node */ struct node { int data; // Data struct node *next; // Address } *head; /* Functions used in the program */ void createList(int n); void deleteList(); void displayList(); int main() { int n, choice; /* * Create a singly linked list of n nodes */ printf("Enter the total number of nodes: "); scanf("%d", &n); createList(n); printf("\nData in the list \n"); displayList(); printf("\nPress 1 to delete entire list: "); scanf("%d", &choice); /* Delete all nodes of list */ deleteList(); printf("\nData in the list \n"); displayList(); return 0; } /* * Create a list of n nodes */ void createList(int n) { struct node *newNode, *temp; int data, i; head = (struct node *)malloc(sizeof(struct node)); /* * If unable to allocate memory for head node */ if(head == NULL) { printf("Unable to allocate memory."); } else { /* * Read data of node from the user */ printf("Enter the data of node 1: "); scanf("%d", &data); head->data = data; // Link the data field with data head->next = NULL; // Link the address field to NULL temp = head; /* * Create n nodes and adds to linked list */ for(i=2; i<=n; i++) { newNode = (struct node *)malloc(sizeof(struct node)); /* If memory is not allocated for newNode */ if(newNode == NULL) { printf("Unable to allocate memory."); break; } else { printf("Enter the data of node %d: ", i); scanf("%d", &data); newNode->data = data; // Link the data field of newNode with data newNode->next = NULL; // Link the address field of newNode with NULL temp->next = newNode; // Link previous node i.e. temp to the newNode temp = temp->next; } } printf("SINGLY LINKED LIST CREATED SUCCESSFULLY\n"); } } /* * Deletes all nodes of the linked list */ void deleteList() { struct node *temp; while(head != NULL) { temp = head; head = head->next; free(temp); } printf("SUCCESSFULLY DELETED ALL NODES OF LINKED LIST\n"); } /* * Displays the entire list */ void displayList() { struct node *temp; /* * If the list is empty i.e. head = NULL */ if(head == NULL) { printf("List is empty."); } else { temp = head; while(temp != NULL) { printf("Data = %d\n", temp->data); // Print data of current node temp = temp->next; // Move to next node } } }Enter the total number of nodes: 5 Enter the data of node 1: 10 Enter the data of node 2: 20 Enter the data of node 3: 30 Enter the data of node 4: 40 Enter the data of node 5: 50 SINGLY LINKED LIST CREATED SUCCESSFULLY Data in the list Data = 10 Data = 20 Data = 30 Data = 40 Data = 50 Press 1 to delete entire list: 1 SUCCESSFULLY DELETED ALL NODES OF LINKED LIST Data in the list List is empty.