Q493
In what manner is a state-space tree for a backtracking algorithm constructed?
A.
Depth-first search
AnswerB.
Breadth-first search
C.
Twice around the tree
D.
Nearest neighbour first
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board