🌳 Recursion Tree Visualizer
Build and analyze recursion trees step by step
How it works:
For a recurrence T(n) = aT(n/b) + f(n), we build a tree where:
• Each node has
a children
(recursive calls)
• Children problems are
n/b
in size
• Each node does
f(n)
work besides recursion
a (# of subproblems)
b (shrink factor)
f(n) work
1 (constant)
n (linear)
n² (quadratic)
log n
n log n
n (input size)
T(n) = 2T(n/2) + n
Presets:
Merge Sort
Binary Search
Strassen
Karatsuba
Case 1 Example
Case 3 Example
Tree Height: h = log
2
(
16
) =
4
levels
🔄 Reset
▶️ Build Next Level
⏩ Build All