Explanation: It always expands the shallowest unexpanded node. 2. How many successors are generated in backtracking search?
A. 1
B. 2
C. 3
D. 4
Answer:A
Explanation: It always expands the shallowest unexpanded node. 2. How many successors are generated in backtracking search?
A. 1 B. 2 C. 3 D. 4
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?