If we want to find last node of a singly... - Solved

Question 21

Computer Awareness Linked Lists Hard

If we want to find last node of a singly linked list then the correct coding is

(A) if (temp \( \rightarrow \) link! = NULL) temp = temp \( \rightarrow \) link

(B) if (temp \( \rightarrow \) data \( == \) Num \( ) \) temp \( = \) temp \( \rightarrow \) link

(C) While (temp \( \rightarrow \) link! = NULL) temp \( = \) temp \( \rightarrow \) link

(D) While (temp \( \rightarrow \) link! = data) temp \( = \) temp \( \rightarrow \) link

✓ Correct Answer: Option C Verified Solution

To reach the last node, we have to keep moving forward as long as the current node has a next node. That needs a loop, not a single if:

while (temp->link != NULL)
    temp = temp->link;

When the loop stops, temp->link is NULL, so temp points to the last node.

Option (A) uses if, so it moves only one step. Options (B) and (D) check the data field, which is unrelated.

Answer: (C)