+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following graph traversals closely imitates level order traversal of a binary tree?

(a) Depth First Search

(b) Breadth First Search

(c) Depth & Breadth First Search

(d) Binary Search

This intriguing question comes from Inorder Traversal in portion Binary Trees of Data Structures & Algorithms I

I got this question by my college professor while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (b) Breadth First Search

Best explanation: Both level order tree traversal and breadth first graph traversal follow the principle that visit your neighbors first and then move on to further nodes.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.