说明：  基本思想是在构造二叉检索树的过程中，当插入一个接点后都去检查是否由于该接点的插入而破坏了二叉检索树的平衡性；若出现绝对值超过1的平衡因子，则需要在保持二叉检索树特性的前提下通过调整使之达到新的平衡。
(The basic idea is to construct binary tree search process, when inserted after a contact to check whether it was due to the insertion point and destroyed the binary search tree balanced If the absolute value of the balance of more than one factor, you need to maintaining binary search trees under the premise of properties by adjusting so that they will reach a new equilibrium.)