+1 vote
in Data Structures & Algorithms I by (110k points)
What is the traversal strategy used in the binary tree?

(a) depth-first traversal

(b) breadth-first traversal

(c) random traversal

(d) Priority traversal

Asked question is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

The question was posed to me by my college professor while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (b) breadth-first traversal

For explanation: Breadth first traversal, also known as level order traversal is the traversal strategy used in a binary tree. It involves visiting all the nodes at a given level.

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.