• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Data Structures | Linked List | Question 17

Consider the following function to traverse a linked list. 

C
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

(D)

None of the above

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments