MCQ
Q.
The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)
Correct Answer: A