Given a Linked List and a key K. The task is to write a program to delete all the nodes from the list that are lesser than the key K.
Input :12->15->9->11->5->6 K = 9 Output : 12 -> 15 -> 9 -> 11 Input : 13->4->16->9->22->45->5->16->6 K = 10 Output : 13 -> 16 -> 22 -> 45 -> 16
Approach: The approach is similar to deleting all nodes from the list which are greater than the given key.
There are two possible cases:
- Head node holds a value less than K: First check for all occurrences at head node which are lesser than ‘K’, delete them and change the head node appropriately.
- Some intermediate node holds value less than k: Start traversing from head and check if current node’s value is less than K. If yes then delete that node and move forward in the list.
Below is the implementation of the above approach:
Initial List: 12 15 9 11 5 6 Final List: 12 15 9 11
Time Complexity: O(N)
- Delete N nodes after M nodes of a linked list
- Delete all the nodes from the list that are greater than x
- Delete alternate nodes of a Linked List
- Delete all odd nodes of a Circular Linked List
- Delete all the even nodes from a Doubly Linked List
- Delete all the even nodes of a Circular Linked List
- Delete all the nodes from the list which are divisible by any given number K
- Delete all Prime Nodes from a Doubly Linked List
- Delete all nodes from the doubly linked list which are divisible by K
- Delete all Prime Nodes from a Singly Linked List
- Delete all the nodes from the doubly linked list that are greater than a given value
- Delete all Non-Prime Nodes from a Singly Linked List
- Delete all the nodes from a doubly linked list that are smaller than a given value
- Delete all odd or even positioned nodes from Circular Linked List
- Delete linked list nodes which have a Lesser Value on Left Side
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.