Recursion Tree
Learn Recursion Tree (Recursion & Backtracking, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
Visualizing Recursive Calls as a Tree Every recursive function's execution can be drawn as a TREE: the root is the initial call, and each node's children are the recursive calls IT makes. This "recursion tree" is exactly how to reason about time complexity - count the total number of nodes, or the work done at each node summed across the tree.