balanced binary tree的意思|示意
平衡二叉树，平衡二元树
balanced binary tree的网络常见释义
平衡二叉树 ...平衡二叉树的定义 平衡二叉树（Balanced Binary Tree）是具有以下性质的二叉树：它是一棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。
平衡二元树 ... 平衡二进制系统 balanced binary system 平衡二元树 balanced binary tree 平衡检查模式 balanced check mode ...
balanced binary tree相关短语
1、 height balanced binary tree 何谓高度平衡二元树 ; 平衡二叉树
2、 Sort balanced binary tree 平衡排序二叉树
3、 strict balanced binary tree 严格平衡二叉树
balanced binary tree相关例句
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be 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。基于这个思路递归处理。
Given a binary tree, determine if it is height-balanced.
给出一个二叉树，判断它高度是不是平衡的。
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.
判断一棵树是否为平衡二叉树。
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。