Hey,
I have a circular linked list, and I'd like to fee the memory that I've malloc'd .
I tried doing this
But as a check to see if it works, I print the list after, and it prints perfectly, indicating that the memory was not cleared. What am I doing wrong?Code:listnode temp; listnode current=NULL; temp=head; while(temp!=NULL) { current=temp; current=current->previous; free(temp); temp=current; }
Thanks!
That does not mean that memory was not cleared. It could mean that you are not removing the nodes correctly, or it could be a bug with the printing.Originally Posted by nkbxwb
To remove all the elements of a circular linked list, I might start at the head and then remove the next node until the head is reached. What exactly is your idea? (I'm not saying that you are wrong; I'm just too lazy to try to debug it step by step - which you should be doing - before I hear what you have to say.)
Look up a C++ Reference and learn How To Ask Questions The Smart Way
I send the printing function the head, and ask it to print. So printing out, I'd assume, means that the head was not cleared. I tried inserting head into that while loop, but I got a segfault. I believe this has to do with running off the end of the list. I'll change some parameters, and see if it works.
Well, you don't seem to actually assign to head, which could explain why head is not cleared, or rather, does not appear to be cleared.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
Also, you will never have 'temp == NULL' for your check because calling free doesn't set everything freed to NULL. So you will start double-freeing until it crashes.
Quzah.
Hope is the first step on the road to disappointment.
