Balanced Binary Tree

Problem

Given a binary tree, determine if it is height-balanced.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

---

Idea

深度优先遍历，得到每个点的左子树和右子树高度，然后比较。

---

Solution

---