题目描述
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.
判断一个二叉树是否是平衡二叉树。解题思路
平衡二叉树(Balanced Binary Tree)又被称为AVL树,且具有以下性质:它是一 棵空树或它的左右两个子树的高度差的绝对值不超过1,并且左右两个子树都是一棵平衡二叉树。
根据定义我们可以很容易的使用递归来解决。
代码
public static boolean isBalanced(TreeNode root) {
if (root == null) {
return true;
}
if (isBalanced(root.left)
&& isBalanced(root.right)
&& Math.abs(getTreeDepth(root.left) - getTreeDepth(root.right)) <= 1) {
return true;
}
return false;
}
public static int getTreeDepth(TreeNode root) {
if (root == null)
return 0;
return Math.max(getTreeDepth(root.left), getTreeDepth(root.right)) + 1;
}