Leetcode 110. Balanced Binary Tree

Check whether a binary tree is height-balanced, i.e., for every node the heights of its left and right subtrees differ by at most one. With up to 5000 nodes, this requires efficiently computing subtree heights and verifying the balance condition for all nodes.