Climbing Stairs (Recursion Tree) Visualizer & Step-by-Step Algorithm Solution

Visualize the recursive decision tree for climbing n stairs taking 1 or 2 steps at a time.

Category: recursion | Difficulty: Easy

Tags: Recursion Tree, Decision Tree, Fibonacci, Call Stack

Climbing Stairs (Recursion Tree)

100%
state
n3
Initialization
1/13
Explanation

Calling climbStairs(3)

Source Code
1function climbStairs(n: number): number {
2 if (n <= 2) return n;
3 return climbStairs(n - 1) + climbStairs(n - 2);
4}