Given a binary tree, determine if it is height-balanced.
A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.
Constraints:
The number of nodes in the tree is in the range [0, 5000]