Problem Statement
Find largest value in binary tree.
Approach
max(node.val, max(left), max(right)).
Time & Space Complexity
Time O(n), Space O(h).
This experience deserves a bigger screen
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