Recursion Tree Monster
A visualization of recursive Fibonacci F(N). Watch how recursive branches spawn new calls and pass return values back up the tree.
5
Current N
0
Function Calls
0
Max Depth
0
Latest Result
RECURSION TREE
Execution Log
Select N and click Start to run.
🛠️ Parameters
Select Input Value (N):
🎨 Legend
Active / Current Call
Call Completed (Returned Value)
Pending Call
⚡ Time Complexity
Recursive Fibonacci has an exponential time complexity of O(2ⁿ).
Increasing N results in massive duplicate call structures.