5. When would you use BFS instead of DFS?
MediumData structures & algorithms
Technical
Show model answer
Breadth-first search explores level by level with a queue, so it finds the shortest path in an unweighted graph and suits "nearest" questions.
Depth-first search goes deep first with recursion or a stack. It uses less memory on wide graphs and fits cycle detection, topological sorting, and exploring all paths or connected components. Both run in O(V + E).