Breadth first search is equivalent to which of the traversal in the binary trees
Answers
Answered by
1
Breadth First Search is equivalent to which of the traversal in the Binary Trees? Explanation: The Breadth First Search Algorithm searches the nodes on the basis of level. It takes a node (level 0), explores it's neighbors (level 1) and so on.
Similar questions
Math,
6 months ago
Math,
6 months ago
Math,
6 months ago
Math,
11 months ago
Social Sciences,
1 year ago
Social Sciences,
1 year ago