DFS

Permutation & combination problems

Basic approaching method:

  1. How many levels in the recursion tree? What does each level represent?

  2. How many different states (branches) on each node in the tree?

  3. Remove the added letter before returning back to previous level if not filling positions

Previous1.1 Check if a Binary Tree is balancedNextV. Backtracking and Other Problems

Last updated

Was this helpful?