Given a singly linked list, delete all occurrences of a given key in it. For example, consider the following list.
Input: 2 -> 2 -> 4 -> 3 -> 2 Key to delete = 2 Output: 4 -> 3
This is mainly an alternative of this post which deletes multiple occurrences of a given key using separate condition loops for head and remaining nodes. Here we use a double pointer approach to use a single loop irrespective of the position of the element (head, tail or between). The original method to delete a node from a linked list without an extra check for the head was explained by Linus Torvalds in his “25th Anniversary of Linux” TED talk. This article uses that logic to delete multiple recurrences of the key without an extra check for the head.
1. Store address of head in a double pointer till we find a non “key” node. This takes care of the 1st while loop to handle the special case of the head.
2. If a node is not “key” node then store the address of node->next in pp.
3. if we find a “key” node later on then change pp (ultimately node->next) to point to current node->next.
Following is C++ implementation for the same.
Created Linked List: 2 3 4 2 2 Linked List after Deletion of 2: 3 4
- Delete all occurrences of a given key in a doubly linked list
- Delete all occurrences of a given key in a linked list
- Delete all nodes from the doubly linked list which are divisible by K
- Check if two Linked Lists are permutations of each other
- Delete all Prime Nodes from a Doubly Linked List
- Print Doubly Linked list in Reverse Order
- Sort Linked List containing values from 1 to N
- Find the Second Largest Element in a Linked List
- Sort a Linked List in wave form
- Check if a Linked List is Pairwise Sorted
- Check if elements of Linked List are present in pair
- Delete all the nodes from the list which are divisible by any given number K
- Replace even nodes of a doubly linked list with the elements of array
- Sandvine Interview Experience for FTE 2018
- Delete all the even nodes from a Doubly Linked List
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.