Height of Binary Tree (Recursive)
Input level-order values → see tree + height
Number of nodes (N):
Level-order values (space separated):
1 2 3 4 5
🌳 Compute Height
🔄 Reset
Height will appear here...
Height =
1 + max(height(left subtree), height(right subtree))
Base case:
height(null) = 0
This is the number of edges on the longest root-to-leaf path.