Status: IN
The empty tree (`None`) is defined as having height 0 in balanced-binary-tree, making `max(left, right) + 1` produce height 1 for a single leaf node — a foundational invariant the recursion depends on.
Source: entries/2026/06/06/balanced-binary-tree-solution.md
JSON