Thread: How do I free a singlely linked list?

what is the proper looping method for freeing a single linked list?
I've never seen this done and my attempt at it is crashing. I am sure that this can be done in a few lines of code.

I tried this:

Code:

do
{
    list=list->next;
    free(list);
}
while(list);

Thanks.

do
{
free(list);
list=list->next;

}while(list);

So you call free on list and then you dereference the pointer you have just freed......... BANG!!

try something like this...

do
{
struct node* currnode;
currnode=list->next; // save location of next node
free(list);
list=currnode;// repoint list at saved node position
}while(list);

Thanks Stoned
I'll give that piece of code a whirl.

;-)
I used to smoke the ganja man. I would get up in the morning, have breakfast, and then go eat. That was many a year ago! I'm an old fart now.
hehe

yes, Stoned_Coder's solution would work just fine...
the "struct node* currnode; " part should be outside the while loop though.

cheers,

Code:

void free_list( Node *n ) 
{
    if( n ) {
        free_list( n->next );
        free( n );
    }
}

Called:

free_list( myList );

Quzah.