题目描述
给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1 。
题解
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null) {
return true;
} else {
return Math.abs((root.left == null ? 0 : getHeight(root.left)) - (root.right == null ? 0 : getHeight(root.right))) < 2 && isBalanced(root.left) && isBalanced(root.right);
}
}
public int getHeight(TreeNode p) {
if(p == null) {
return 0;
} else {
int leftHeight = getHeight(p.left);
int rightHeight = getHeight(p.right);
return Math.max(leftHeight, rightHeight) + 1;
}
}
}