Hello,
Let's say i have a struct
Code:struct node { int item; struct node *next };
The code for traversing a linked list is this
Here comes my stupid question.Since current is a node,wouldn'tCode:while(current != NULL) { current->item=5; current = current->next; }
replace the node current with the next one and lose all the information we know about the current node?Code:current = current->next;
Last edited by Konstantinos; 11-10-2013 at 07:32 AM.
> replace the node current with the next one and lose all the information we know about the current node?
You're not replacing the node, you're just updating a pointer to one node to point to another node.
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.
Thanks for your time.
