Hi,
I am attaching this code I wrote for linked list of 3 nodes (2 dummies and 1 node).. For some reason it is giving me a segmention fault when I run the code. it executes till the last and prints what is stored. The problem occurs at the free() stage. It says segmentation fault.Please help..thanks in advance.
You can't free memory you didn't allocate. You malloc some memory and point to it with ptr. Then, you change ptr to point to &newNode, and lose your handle to the memory you malloc'ed, causing a memory leak. You try to free ptr (pointing to newNode), causing a seg fault. Also, you probably don't want to set tail->next to point back at tail. The traditional sentinel value for end of list is NULL.
You malloc some memory into ptr, then you overwrite ptr with the address of a local variable. Then, when you try to free(ptr), it fails because it points to a local variable which resides on the stack, and not allocated memory. You don't need the local variable newNode at all.
Also, tail->next shouldn't point to itself, otherwise you end up with a circular list. It should be set to NULL instead.
EDIT: too slow!
Please... post your code HERE in the open...Quote:
Originally Posted by livin
A lot of us will (understandably) not want to download files of unknown content.