Home Questions Search Forum Contact Guest Book Polls! Got a Question?
PREV Linked Lists NEXT   (12 / 301)     Write a C program to free the nodes of a linked list Before looking at the answer, try writing a simple C program (with a for loop) to do this. Quite a few people get this wrong. This is the wrong way to do it struct list *listptr, *nextptr; for(listptr = head; listptr != NULL; listptr = listptr->next)  {   free(listptr); } If you are thinking why the above piece of code is wrong, note that once you free the listptr node, you cannot do something like listptr = listptr->next!. Since listptr is already freed, using it to get listptr->next is illegal and can cause unpredictable results! This is the right way to do it struct list *listptr, *nextptr; for(listptr = head; listptr != NULL; listptr = nextptr)  {   nextptr = listptr->next;   free(listptr); } head = NULL; After doing this, make sure you also set the head pointer to NULL! PREV COMMENTS                                  INDEX                                  PRINT NEXT Last updated: November 3, 2005 www.cracktheinterview.com - Your destination for the most common IT interview questions, answers, frequently asked interview questions (FAQ), C Programs, C Datastructures for technical interviews conducted by the top IT companies around the world!