Algorithms | Backtracking | Question 1

Which of the following is not a backtracking algorithm?

**(A)** Knight tour problem

**(B)** N queen problem

**(C)** Tower of hanoi

**(D)** M coloring problem

**Answer:** **(C)** **Explanation:** Knight tour problem, N Queen problem and M coloring problem involve backtracking. Tower of hanoi uses simple recursion.