给定一个二叉树,判断它是否是高度平衡的二叉树。
本题中,一棵高度平衡二叉树定义为:
一个二叉树每个节点?的左右两个子树的高度差的绝对值不超过 1 。
示例 1:
3
/ \
9 20
/ \
15 7
输入:root = [3,9,20,null,null,15,7]
输出:true
示例 2:
1
/ \
2 2
/ \
3 3
/ \
4 4
输入:root = [1,2,2,3,3,null,null,4,4]
输出:false
提示:
树中的节点数在范围 [0, 5000] 内
- <= Node.val <=
package com.loo;
public class BalancedBinaryTree {
public static void main(String[] args) {
TreeNode root = new TreeNode(3);
TreeNode left1 = new TreeNode(9);
TreeNode right1 = new TreeNode(20);
TreeNode right2 = new TreeNode(15);
TreeNode right3 = new TreeNode(7);
root.left = left1;
root.right = right1;
right1.left = right2;
right1.right = right3;
System.out.println(isBalancedBinaryTree1(root));
System.out.println(isBalancedBinaryTree2(root));
TreeNode root2 = new TreeNode(1);
TreeNode left21 = new TreeNode(2);
TreeNode right21 = new TreeNode(2);
TreeNode left22 = new TreeNode(3);
TreeNode left23 = new TreeNode(3);
TreeNode left24 = new TreeNode(4);
TreeNode left25 = new TreeNode(4);
root2.right = right21;
root2.left = left21;
left21.left = left22;
left21.right = left23;
left22.left = left24;
left22.right = left25;
System.out.println(isBalancedBinaryTree1(root2));
System.out.println(isBalancedBinaryTree2(root2));
}
public static boolean isBalancedBinaryTree1(TreeNode root) {
if (root == null) {
return true;
}
return Math.abs(getTreeHeight1(root.left) - getTreeHeight1(root.right)) <= 1 && isBalancedBinaryTree1(root.left) && isBalancedBinaryTree1(root.right);
}
public static int getTreeHeight1(TreeNode root) {
if (root == null) {
return 0;
}
return Math.max(getTreeHeight1(root.left), getTreeHeight1(root.right)) + 1;
}
public static boolean isBalancedBinaryTree2(TreeNode root) {
if (root == null) {
return true;
}
return getTreeHeight2(root)>=0;
}
public static int getTreeHeight2(TreeNode root) {
if (root == null) {
return 0;
}
int leftHeight = getTreeHeight2(root.left);
int rightHeight = getTreeHeight2(root.right);
if (leftHeight == -1 || rightHeight == -1 || Math.abs(leftHeight - rightHeight) > 1) {
return -1;
}
return Math.max(leftHeight, rightHeight) + 1;
}
static class TreeNode {
int value;
TreeNode left;
TreeNode right;
public TreeNode(int v) {
value = v;
}
}
}