Riddle
Here is some code that operates on a singly linked list. Say P is pointer to a linked list. Linked list node has value and next elements.
Q=P->next;
P->next=NULL;
while (!Q)
{
S = Q;
Q=Q->next;
S->next = P;
P=S;
}
at the end of the code what is the value of P. what is the end result.
The value of P remains unchanged, because the code segment in braces in never executed due to this statement:
while (!Q)
That's the way I see it, anyway. Let me know if you need more help with homework problems. For extra credit, mention to your instructor that he forgot to free the memory he had allocated to the node P->next.
In the above code snippet changed the While statement.
Q=P->next;
P->next=NULL;
while (Q)
{
S = Q;
Q=Q->next;
S->next = P;
P=S;
}
