What is the space complexity of Breadth-first search, consider b as branching factor and d as depth of the search tree?
Posted: Mon Jun 06, 2022 1:27 pm
- What Is The Space Complexity Of Breadth First Search Consider B As Branching Factor And D As Depth Of The Search Tree 1 (24.89 KiB) Viewed 49 times
What is the space complexity of Breadth-first search, consider b as branching factor and d as depth of the search tree? O(d^2b) O(b^(d+1)) O(b^2d) O(b^2)