Recursion Tree Visualizer
Understand how recursive calls branch out and build a result through the call tree.
📜 Execution Log
Select N and click Start to see the recursion tree.
🎨 Legend
Active/Checking
Returned
Value
Future
Call
🧠 About Fibonacci
The recursive Fibonacci algorithm has an exponential time complexity of O(2ⁿ). As you increase N, you'll see how many duplicate calls are made—this is why Dynamic Programming (Memoization) is so powerful.