Given a linked list using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?
A) NodePtr here;
Here=head;
Whilehere-link != NULL)
{
Here = here -link;
}
Return here-data;
B) NodePtr here;
Here=head-link;
Whilehere != NULL)
{
Here = here -link;
}
Return here-data;
C) NodePtr here;
Whilehere-link != NULL)
{
Here = here -link;
}
Return here-data;
D) NodePtr here;
Here=head;
Whilehere-link != NULL)
{
Here = here -link;
}

Question

Given a linked list using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?
A) NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data;
B) NodePtr here;
Here=head->link;
Whilehere != NULL)
{
Here = here ->link;
}
Return here->data;
C) NodePtr here;
Whilehere->link != NULL)
{
Here = here ->link;
}
Return here->data;
D) NodePtr here;
Here=head;
Whilehere->link != NULL)
{
Here = here ->link;
}

Quizplus · Accepted Answer

Option A starts at the head of the linked list and iterates through each node using the link field until it reaches the end of the list (where the link is NULL). It then returns the data of the last node. This correctly implements a function to return the last item in the linked list. Option B and C start at the second node of the linked list (head->link), which will not necessarily be the last node. Option D is identical to option A but does not return anything, so it is not a valid solution to the problem presented.

Given a Linked List Using the Code from the Book)