Our website is made possible by displaying online advertisements to our visitors. Please consider supporting us by whitelisting our website.

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

/ » High Performance Computing (HPC) solved MCQs / By
Question:

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

Answer» c. level-order traversal

Note: The above multiple-choice question is for all general and Competitive Exams in India.