Problem Statement
Calculate height of binary tree.
Approach
height(node) = 1 + max(height(left), height(right)).
Time & Space Complexity
Time O(n), Space O(h).

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Find maximum depth of tree.
Calculate height of binary tree.
height(node) = 1 + max(height(left), height(right)).
Time O(n), Space O(h).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.