<<< split from Deleting nodes from a linked list >>>
Hello.I am new in C.I must write code for the game reversi(or othello).I have problem with the command UNDO.I want to delete only the last node of a simply linked list.I thought that what i must do is to go the prelast node,put there next=NULL; and then free the last node.However i have not managed to navigate through the list,because i get segmentation fault.
Thanks in advance
//This is my first post in this forum
Consider something like
curr will be the last nodeCode:while ( curr->next != NULL ) { prev = curr; curr = curr->next; }
prev will be the node (next to last) pointing to it.
The only trick is when you're deleting the only node in the list.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
ok.thanks.By the way i found another way to do it.Originally Posted by Salem
