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

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

Which of the following is not an application of Breadth First Search?

Question:

Which of the following is not an application of Breadth First Search?

A.

when the graph is a binary tree

B.

when the graph is a linked list

C.

when the graph is a n-ary tree

D.

when the graph is a ternary tree

Answer» b. when the graph is a linked list

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