{"id":27061,"date":"2018-01-02T21:40:01","date_gmt":"2018-01-02T16:10:01","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27061"},"modified":"2018-01-02T21:40:01","modified_gmt":"2018-01-02T16:10:01","slug":"c-algorithm-write-function-delete-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-write-function-delete-linked-list\/","title":{"rendered":"Cpp Algorithm – Write a function to delete a Linked List"},"content":{"rendered":"

Algorithm For C\/C++:<\/strong> Iterate through the linked list and delete all the nodes one by one. Main point here is not to access next of the current pointer if current pointer is deleted.<\/p>\n

In Java<\/strong>, automatic garbage collection happens, so deleting a linked list is easy. We just need to change head to null.<\/p>\n

C++ Programming:<\/strong><\/p>\n

<\/div> 
\/\/ C program to delete a linked list#include<stdio.h>#include<stdlib.h>#include<assert.h> \/* Link list node *\/struct node{    int data;    struct node* next;}; \/* Function to delete the entire linked list *\/void deleteList(struct node** head_ref){   \/* deref head_ref to get the real head *\/   struct node* current = *head_ref;   struct node* next;    while (current != NULL)    {       next = current->next;       free(current);       current = next;   }      \/* deref head_ref to affect the real head back      in the caller. *\/   *head_ref = NULL;} \/* Given a reference (pointer to pointer) to the head  of a list and an int, push a new node on the front  of the list. *\/void push(struct node** head_ref, int new_data){    \/* allocate node *\/    struct node* new_node =            (struct node*) malloc(sizeof(struct node));     \/* put in the data  *\/    new_node->data  = new_data;        \/* link the old list off the new node *\/    new_node->next = (*head_ref);        \/* move the head to point to the new node *\/    (*head_ref)    = new_node;} \/* Drier program to test count function*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;        \/* Use push() to construct below list     1->12->1->4->1  *\/    push(&head, 1);    push(&head, 4);    push(&head, 1);     push(&head, 12);    push(&head, 1);           printf("\\n Deleting linked list");    deleteList(&head);          printf("\\n Linked list deleted");}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
 Deleting linked list\r\n Linked list deleted<\/pre>\n
Time Complexity:<\/strong> O(n)
\nAuxiliary Space:<\/strong> O(1)<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C++ Algorithm – Write a function to delete a Linked List – Linked List –  Iterate through the linked list and delete all the nodes one by one.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[83515,1,79476,79478],"tags":[79917,80732,79922,79925,79918,79914,79921,80734,80733,79915,79923,80735],"class_list":["post-27061","post","type-post","status-publish","format-standard","hentry","category-c-programming-3","category-coding","category-linked-list","category-singly-linked-list","tag-delete-a-node-from-linked-list-algorithm","tag-delete-a-node-from-linked-list-using-one-pointer","tag-delete-a-node-in-singly-linked-list","tag-delete-a-node-in-the-middle-of-a-singly-linked-list","tag-delete-last-node-in-linked-list-in-c","tag-delete-node-at-given-position-in-a-linked-list","tag-deletion-in-linked-list-in-data-structure","tag-destructor-linked-list-c","tag-linked-list-delete-java","tag-linked-list-delete-node-java","tag-write-a-program-to-delete-a-node-from-linked-list-in-c","tag-write-an-algorithm-to-delete-an-element-from-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27061","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27061"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27061\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27061"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27061"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27061"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}