给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 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;
}
int leftHeight = maxDepth(root.left);
int rightHeight = maxDepth(root.right);
//根节点的左右两棵树的高度差是否<2 并且递归左树是否平衡 并且递归右树是否平衡 要同时满足
// Math.abs()求绝对值
return Math.abs(leftHeight - rightHeight) < 2 &&
isBalanced(root.left) && isBalanced(root.right);
}
//求得树的最大深度
public int maxDepth(TreeNode root) {
if(root == null) {
return 0;
}
int leftHeight = maxDepth(root.left);
int rightHeight = maxDepth(root.right);
return leftHeight > rightHeight ? leftHeight+1 : rightHeight+1;
}
}