Balanced Binary Tree

Statement

Given a binary tree with $n$ nodes, return TRUE if it is height-balancedA binary tree is considered height-balanced if the difference between the heights of the two subtrees for each node is not more than 1.. Otherwise, return FALSE.

Note: The height of an empty tree is $0$ ...