定义:https://zh.wikipedia.org/wiki/平衡树
如何判断是否是BST:
An empty tree is height-balanced. A non-empty binary tree T is balanced if:
- Left subtree of T is balanced
- Right subtree of T is balanced
- The difference between heights of left subtree and right subtree is not more than 1.
树中的节点应当是排序过的。
如何构造平衡树: