What is the space complexity of Depth-first search?
A. O(b)
B. O(bl)
C. O(m)
D. O(bm)
Answer:A
What is the space complexity of Depth-first search?
A. O(b) B. O(bl) C. O(m) D. O(bm)
Explanation:O(bm) is the space complexity where b is the branching factor andm is the maximum depth of the search tree.