Question
The Data structure used in standard implementation of Breadth First Search is?
Answer: Option B
Was this answer helpful ?
The Breadth First Search explores every node once and put that node in queue and then it takes out nodes from the queue and explores it's neighbors.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution