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的二叉树。