判断一棵树是否为平衡二叉树。
平衡二叉树和半边匹配数据结构的引入，提高了拓扑信息重建的速度。
The execution rate of topological reconstruction is enhanced by introducing the AVL tree and half edge data structure.
提出了基于哈希表和平衡二叉树的证书撤销方案，并分析了该方案的有效性和安全性。
This paper proposes a promoted certificate revocation based on Hash table and balanced binary tree, and gives the analysis of validity and security.
题目大意：给定一棵二叉树，请判断该二叉树是否是平衡二叉树。 所谓平衡二叉树就是每个节点的两颗子树深度不超过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。基于这个思路递归处理。
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.
应用推荐