Question
The Breadth First Search traversal of a graph will result into?
Answer: Option B
Was this answer helpful ?
The Breadth First Search will make a graph which don't have back edges (a tree) which is known as Breadth First Tree.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution