Explanation: Each partially expanded node remembers which successor to generate next because of these condition, it uses less memory. 3. What is the space complexity of Depth-first search?
A. O(b)
B. O(bl)
C. O(m)
D. O(bm)
Answer:A
Explanation: Each partially expanded node remembers which successor to generate next because of these condition, it uses less memory. 3. 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 and m is the maximum depth of the search tree. 4. Which search algorithm imposes a fixed depth limit on nodes?