Backtracking is a depth-first search over a decision tree: you build a partial solution, and when it becomes invalid you undo the last choice and try another. It’s used for problems like permutations, N-Queens, Sudoku, and subset search with pruning.