⟳ Recursion Visualizer
Animated Call Stack Explorer
FAANG Prep
▶ Visualize
📋 Problems
📚 Concepts
Function
Fibonacci
Factorial
Sum Array
Power
Binary Search
Merge Sort
Tree Traversal
Tower of Hanoi
n =
⚠ Large n! Showing n=8 to keep it readable.
← Prev
▶ Play
→ Next
↺ Reset
Speed
Normal
Step 0 of 0
Call Stack
(depth: 0)
Press ▶ Play or → Next to start the visualization
Recursion Tree
Return Value Chain
Return values will appear here as they resolve...
Calls made:
0
Max depth:
0
Returns:
0
Duplicate calls:
0
Time complexity:
—
Space (stack):
—