C: How to free nodes in the linked list?

by

An iterative function to free your list:

void freeList(struct node* head)
{
   struct node* tmp;

   while (head != NULL)
    {
       tmp = head;
       head = head->next;
       free(tmp);
    }

}

What the function is doing is the follow:

  1. check if head is NULL, if yes the list is empty and we just return

  2. Save the head in a tmp variable, and make head point to the next node on your list (this is done in head = head->next

  3. Now we can safely free(tmp) variable, and head just points to the rest of the list, go back to step 1

More Related Contents:

  1. Assorting linked list in c [duplicate]
  2. How to debug why my C code causes a segmentation fault? [closed]
  3. Debugging a linked-list
  4. Please help me out, i want to display the linked list, reverse it & display then again display it
  5. Are there differences between pointers to object stored on stack and heap? [closed]
  6. How to reverse a singly linked list using only two pointers?
  7. Setting variable to NULL after free
  8. What is the reason for using a double pointer when adding a node in a linked list?
  9. Using pointers to remove item from singly-linked list
  10. What is a contiguous memory block?
  11. Problems with character input using scanf()
  12. Why would you ever want to allocate memory on the heap rather than the stack? [duplicate]
  13. Rationale behind the container_of macro in linux/list.h
  14. Deleting a middle node from a single linked list when pointer to the previous node is not available
  15. Linked list recursive reverse
  16. Where in memory are string literals ? stack / heap? [duplicate]
  17. Size of stack and heap memory [duplicate]
  18. Finding the intersecting node from two intersecting linked lists
  19. Merging two sorted linked lists
  20. Is it required that a C Variable Length Array is allocated from the stack?
  21. memory allocation in Stack and Heap
  22. How to implement a linked list in C?
  23. Where do malloc() and free() store allocated sizes and addresses?
  24. How to check heap size for a process on Linux
  25. Update a struct in Arduino
  26. Why My DeCompression is showing an Error?
  27. What is the difference between ‘asm’, ‘__asm’ and ‘__asm__’?
  28. Why do I first have to strcpy() before strcat()?
  29. Return value of “==” operator in C
  30. Why GDB jumps unpredictably between lines and prints variables as “”?

Leave a Comment