![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645186041281-Function%20to%20delete%20a%20Linked%20list-05-05.png\")
<\/p>\n<\/p>\n
The linked list is one of the most important 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
In this question, we are given a singly linked list. We have to write a function that takes the head of the list as a parameter and deletes the complete linked list.<\/p>\n
Suppose the linked list is 1 – > 2 – > 3 – > 4. Now, we have to delete this linked list.<\/p>\n
Input:<\/strong><\/p>\n Output:<\/strong> NULL (Empty List)<\/p>\n This question is not a very complex one. Firstly, do we have to do the linked list deletion in Java and Python? The answer is No. We have to solve it only for C++, as in Java and Python, an automatic garbage collection process happens, so the deletion of a linked list is easy. In Java and Python, we just have to change the head to NULL. <\/p>\n Let us have a glance at the approach.<\/p>\n The approach is going to be pretty simple. We are going to create two nodes, current and temp, current will point to the head and temp will be NULL. Now, we will traverse through the list until the current is not NULL. In every iteration, we will make temp point to the next of current. Then, we will free current and lastly, the temp will become the new current.<\/p>\n In the end, we will make the head of the list NULL.<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Function-to-delete-a-Linked-list-input-01.png\")
<\/p>\nApproach<\/h3>\n
Algorithm<\/h3>\n
\n
\n1) Store the next of current in temp.
\n2) free(current)
\n3) Make temp as the new current.<\/li>\nDry Run<\/h3>\n
![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/Function-to-delete-a-Linked-list-dry-run-01.png\")
<\/p>\nCode Implementation<\/h3>\n\t\t\t\t\t\t