Breadth First Search is equivalent to which of the traversal in the Binary Trees?
A)pre-order traversal
B)post-order traversal
C)level-order traversal
D)in-order traversal

Question

Quizplus · Accepted Answer

Breadth First Search (BFS) in graphs is equivalent to level-order traversal in binary trees, as both involve visiting all nodes at the present depth/level before moving on to the nodes at the next level.

Breadth First Search Is Equivalent to Which of the Traversal