A tree is balanced if and only if for every node the heights of its two subtrees differ by at most 1.

• 当且仅当两个子树的高度差不超过1时，这个树是平衡二叉树。（同时是排序二叉树）