freeing list that gets nodes from block

ok, lets say i have a function that gets nodes for a linked list from a malloc'ed/calloc'ed block of structs. lets also say that the function exhaust several blocks. after im finished doing whatever with the list, how do i free all the nodes. i dont think i could just traverse the list freeing each node because id end up freeing addresses that have already been freed (i think). i thought maybe i could either store the beginning address of each block allocated on a stack then traverse through that or maybe i could free the first node in the list, go down BLOCKSIZE nodes, free and repeat until end of list but im not sure which would be the best way to do it. im not even sure if thats the way it should be done.
id really appreciate it if you guys could help me out with this. thanks in advance.

What do you need help for? You've already suggested two solutions to your problem, have you tried them yet? To be perfectly honest the best way to learn both programming and problem solving is to fiddle around with any and all laternatives that you can think of.

I know that that isn't the answer you wanted, but it is the answer you needed :)

-Prelude

Well you can ALMOST free them sequentially. In the 'delete' function, use a temp variable as a placeholder like this:

void DeleteList(Node *head)
{
Node *me;
Node *t = head;

while(t->next != NULL)
{
me = t;
t = t->next;
free(me);
}
free(t); // Last node...
}