Artificial Intelligence MCQ
What is the space complexity of Depth-first search?
A)
O(b)
B)
O(bm)
C)
O(m)
D)
O(bl)

Correct Answer : Option (B) :   O(bm)

Explanation : O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree.