Computer Science · Data Structures
Which of the following code segments correctly traverses a singly linked list to find its last node?
- 1while (temp->link != data) temp = temp->link;
- 2while (temp->link != NULL) temp = temp->link;✓
- 3if (temp->data == Num) temp = temp->link;
- 4if (temp->link != NULL) temp = temp->link;
Correct answer
while (temp->link != NULL) temp = temp->link;
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures