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
View Dynamic Solution & Explanation
Correct Solution: Option C

Step-by-step Solution:

No explanation entered yet.