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.
建立高度平衡的二叉搜索樹是爲(wèi)了提高二叉搜索樹的傚率，減少樹的平均搜索長(zhǎng)度。
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.
我不會(huì)詳細(xì)介紹二叉樹理論的詳細(xì)細(xì)節(jié)，因爲(wèi)這些東西，Per Nilsson 已經(jīng)在他的“二叉樹”中討論過(guò)了，你可以在如下地址here找到詳細(xì)的細(xì)節(jié)。
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.
對(duì)於這個(gè)問(wèn)題，一個(gè)高度平衡的二叉樹是指每個(gè)節(jié)點(diǎn)的兩個(gè)子節(jié)點(diǎn)的深度的差異都不超過(guò)1的二叉樹。