look at the search tree given below root solution solution (badsolution (badsolution solution (badsolution (goodstep start with the root node the two available options are--solution and solution select solution step at solution there are again two options--solution and solution select solution step since solution is not good (valid and possiblecandidatebacktrack to solution and now select solution step since solution is not good (valid and possiblecandidatebacktrack to solution now there are no more options available at solution aso select solution step at solution there are two options--solution and solution select solution step since solution is not good (valid and possiblecandidatebacktrack to solution and now select solution step solution is good (valid and possiblecandidateso the algorithm stops here advantageby terminating searches and not exploring candidates that cannot lead to valid possible solutionsthe backtracking technique reduces the number of nodes examined the algorithm can be used to solve exponential time problems in reasonable amount of time note backtracking is not an optimization technique it just reduces the search space