Q716
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.)
A.
O(bd+1) and O(bd+1)
AnswerB.
O(b2) and O(d2)
C.
O(d2) and O(b2)
D.
O(d2) and O(d2)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board