·高度平衡二叉树（height Balanced binary tree）：或是一棵空树， 或是具有下列性质的二叉树：它的左右子树均为平衡二叉树，且它们二者的深度之差不超过1。
基于12个网页-相关网页
height-balanced binary search tree 高度平衡二元搜寻树
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。基于这个思路递归处理。
应用推荐