Question

Backtracking algorithm is implemented by constructing a tree of choices called as?

(a) State-space tree

(b) State-chart tree

(c) Node tree

(d) Backtracking tree

This question was posed to me by my school principal while I was bunking the class.

Question is from Backtracking in chapter Backtracking of Data Structures & Algorithms II

Answer 1

Right option is (a) State-space tree

For explanation: Backtracking problem is solved by constructing a tree of choices called as the state-space tree. Its root represents an initial state before the search for a solution begins.