balanced binary tree

基本解释

The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
建立高度平衡的二叉搜索樹是爲了提高二叉搜索樹的傚率，減少樹的平均搜索長度。
I won't go into the gory details of Binary Tree Theory as this has already been discussed by Per Nilsson in his "Balanced Binary Tree" submission found here.
我不會詳細介紹二叉樹理論的詳細細節，因爲這些東西，Per Nilsson 已經在他的“二叉樹”中討論過了，你可以在如下地址here找到詳細的細節。
blog.sina.com.cn
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.
對於這個問題，一個高度平衡的二叉樹是指每個節點的兩個子節點的深度的差異都不超過1的二叉樹。