In what manner is a state-space tree for a backtracking algorithm constructed?
(a) Depth-first search
(b) Breadth-first search
(c) Twice around the tree
(d) Nearest neighbour first
This question was posed to me during an online interview.
The question is from Backtracking in division Backtracking of Data Structures & Algorithms II