Delete all occurrences of a given key in a linked list ?<\/h2>\n<\/div>\n<\/div>\n

\n

\n

\n
• Given a\u00a0singly linked list, delete all occurrences of a given key in it. For example,<\/li>\n<\/ul>\n
  <\/div>

  Input:  2 -> 1 -> 8 -> 2 ->  3 ->  2 -> 7       Key to delete = 2Output:  1 -> 8 -> 3 -> 7 <\/code><\/pre> <\/div>\n
  Sample Code in C<\/h2>\n
   
   <\/div> 
  #include <stdio.h> #include <stdlib.h> \/\/ A linked list node struct Node {     int data;     struct Node *next; }; \/* Given a reference (pointer to pointer) to the head of a list    and an int, inserts a new node on the front of the list. *\/void push(struct Node** head_ref, int new_data) {     struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));     new_node->data  = new_data;     new_node->next = (*head_ref);     (*head_ref)    = new_node; } \/* Given a reference (pointer to pointer) to the head of a list and    a key, deletes all occurrence of the given key in linked list *\/void deleteKey(struct Node **head_ref, int key) {     \/\/ Store head node     struct Node* temp = *head_ref, *prev;     \/\/ If head node itself holds the key or multiple occurrences of key     while (temp != NULL && temp->data == key)     {         *head_ref = temp->next;   \/\/ Changed head         free(temp);               \/\/ free old head         temp = *head_ref;         \/\/ Change Temp     }     \/\/ Delete occurrences other than head     while (temp != NULL)     {         \/\/ Search for the key to be deleted, keep track of the         \/\/ previous node as we need to change 'prev->next'         while (temp != NULL && temp->data != key)         {             prev = temp;             temp = temp->next;         }         \/\/ If key was not present in linked list         if (temp == NULL) return;         \/\/ Unlink the node from linked list         prev->next = temp->next;         free(temp);  \/\/ Free memory         \/\/Update Temp for next iteration of outer loop         temp = prev->next;     } } \/\/ This function prints contents of linked list starting from \/\/ the given node void printList(struct Node *node) {     while (node != NULL)     {         printf(" %d ", node->data);         node = node->next;     } }    \/* Drier program to test above functions*\/int main() {     \/* Start with the empty list *\/    struct Node* head = NULL;     push(&head, 7);     push(&head, 2);     push(&head, 3);     push(&head, 2);     push(&head, 8);     push(&head, 1);     push(&head, 2);     push(&head, 2);     int key = 2; \/\/ key to delete     puts("Created Linked List: ");     printList(head);     deleteKey(&head, key);     puts("\\nLinked List after Deletion: ");     printList(head);     return 0; }<\/code><\/pre> <\/div>\n
  \n
  \n
  Output<\/h2>\n<\/div>\n<\/div>\n
  \n
  \n
  \n
  Created Linked List:\r\n 2  2  1  8  2  3  2  7\r\nLinked List after Deletion:\r\n 1  8  3  7 <\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
  Answer : Given a singly linked list, delete all occurrences…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,971,491,221,368,3494,203,199,214,198,363,3057,3601,3290,3292,3496,3289,3603,3602,3503,3286,205,3604,222,484,3054,196,212,207,366,204,3605,15925,206,972,200,3055,197,968,3056,3600,3606,3599,285,969],"class_list":["post-509","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-applied-materials-interview-questions-and-answers","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-c-program-to-delete-first-node-in-linked-list","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-te-interview-questions-and-answers","tag-delete-a-specific-node-in-linked-list-java","tag-delete-all-nodes-in-doubly-linked-list-c","tag-delete-at-position-in-a-doubly-linked-list","tag-delete-first-node-in-linked-list-c","tag-delete-last-node-in-doubly-linked-list-in-c","tag-delete-last-node-in-linked-list-c","tag-delete-last-node-in-linked-list-in-c","tag-delete-node-at-given-position-in-a-linked-list-in-c","tag-delete-node-from-doubly-linked-list-java","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-doubly-linked-list-geeksforgeeks","tag-flipkart-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-remove-element-from-doubly-linked-list-c","tag-samsung-interview-questions-and-answers","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-write-a-program-to-delete-a-node-from-linked-list-in-c","tag-write-ac-program-to-delete-a-particular-element-in-the-doubly-linked-list","tag-write-an-algorithm-to-delete-duplicate-elements-in-a-singly-linked-list","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n