A backtracking algorithm generates, explicitly or implicitly, a state-space tree.
Introduction to the design & analysis of algorithms / Anany Levitin
I wonder that whether the saying always holds. If yes, is it always binary tree? For any problem which can be solved by backtracking, skeleton of the solution can be generalized?