![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645012084665-Article_199.png\")
<\/p>\n<\/p>\n
The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a huge plus point in a coding interview.<\/p>\n<\/p>\n
Delete a node with a given key from the given linked list and in case there are multiple occurrences of a given key in the linked list, then delete the first occurrence of this key in the linked list.<\/p>\n
According to the problem statement, we are given a linked list and we have to delete a node with a given key value, it may be present anywhere in the linked list but, there can be two different situations are first being when there is more than one node having the same key and the next being when the node is not at all present in the linked list, so now, you all might think that what we need to do?<\/p>\n
In the case where there are multiple nodes, you will just have to delete the first node in the linked list with the value equal to the key, and in the case where the node to be deleted is not present at all in the linked list then simply return and exit the program.<\/p>\n
Now, let us understand this problem by taking a very simple example:<\/p>\n
If the given linked list is:<\/p>\n
![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/10\/input.png\")
<\/p>\n
key<\/strong> = 7<\/p>\n Let’s see another example:<\/p>\n If the given linked list is: 1 \u2192 2 \u2192 3 \u2192 4 \u2192 5 and key<\/strong> = 4<\/p>\n Now I think from the above examples, the problem is clear. So let\u2019s see how we can approach it.<\/p>\n Before moving to the approach section, try to think about how you can approach this problem.<\/p>\n Let\u2019s move to the approach section. Now, first, let\u2019s discuss the recursive approach to this problem and understand how it works, we will simply follow the steps to understand initially how recursion works for deleting a node from the linked list.<\/p>\n I hope the above approach might have just given you the basic idea of how recursion will work here, so now let\u2019s look at the algorithm for this method<\/p>\n Now, let\u2019s completely understand the algorithm behind the recursive method, and we will simply follow the steps to delete the node with the given key.<\/p>\n\n
![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/10\/output-1.png\")
<\/p>\n\n
\n
Approach: (Recursive)<\/h3>\n
\n
Algorithm: (Recursive)<\/h3>\n
\n
\n
\nAs we know that the current node is accessed by the previous node\u2019s next, which is passed by reference. hus, we can say that if we update the current node, previous node\u2019s next will also get updated.<\/p>\n\n
Dry run<\/h3>\n
![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/10\/p_1_1_1_2.png\")
<\/p>\nCode<\/h3>\n\t\t\t\t\t\t