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