ReiserFS uses a specially optimized b* balanced tree (one per filesystem) to organize all filesystem data.
ReiserFS使用了特殊的优化b*平衡树（每个文件系统一个）来组织所有的文件系统数据。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
It is a shame that the fourth tree is almost clipped off, and there is just a little too much space to the left which, because of the clipped tree, isn't balanced on the right.
很遗憾第四棵树几乎要被剪掉，照片左侧似乎留空过多，因为那课未入镜的树使得右侧也不那么平衡。
That's why the red-black rules keep the tree balanced.
这就是为什么红-黑规则能保证树是平衡的。
"We looked for a way to make it seem like the main volume is levitating, like a tree house, but simultaneously it had to be balanced and pure," said the architects.
“我们寻找一种方式使它看起来像悬浮着的主要体块，像一间树屋一样，但同时它必须能够达到平衡、纯净的感觉，”建筑师说道。
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找到详细的细节。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
He balanced himself with legs tucked around the tree and took off his pack.
他平衡自己，用腿绕在树上，然后脱下背包。
If I wished to make the tree more restful and balanced, I could reduce the foliage mass on the left and increase the foliage mass on the right.
如果想使树桩显得更悠闲和平衡，那么可以减少树枝在左面的分布，而增加右侧枝叶的分布。
An array is already a balanced B-tree, it is true?
一种阵列已经是一个平衡的二叉树，它是真的吗？
This paper proposes a promoted certificate revocation based on Hash table and balanced binary tree, and gives the analysis of validity and security.
提出了基于哈希表和平衡二叉树的证书撤销方案，并分析了该方案的有效性和安全性。
Given a binary tree, determine if it is height-balanced.
判断一棵树是否为平衡二叉树。
Given a binary tree, determine if it is height-balanced.
给出一个二叉树，判断它高度是不是平衡的。
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。基于这个思路递归处理。
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的二叉树。
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。
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。
应用推荐