算法精粹(algorithm-essentials)

感谢soulmachine@github提供内容
## Balanced Binary Tree


### 描述

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.


### 分析




### 代码

{% codesnippet "./code/balanced-binary-tree."+book.suffix, language=book.suffix %}{% endcodesnippet %}