Consider the following function to traverse a linked list.
void traverse( struct Node *head)
{
while (head->next != NULL)
{
printf ( "%d " , head->data);
head = head->next;
}
}
|
Which of the following is FALSE about above function?
(A) The function may crash when the linked list is empty
(B) The function doesn’t print the last node when the linked list is not empty
(C) The function is implemented incorrectly because it changes head