题目描述
输入一棵二叉树,判断该二叉树是否是平衡二叉树。
在这里,我们只需要考虑其平衡性,不需要考虑其是不是排序二叉树
package test;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
class Solution { // 也就是在求二叉树的深度的同时,求一下left - right的绝对值是不是大于1
public int depth(TreeNode root){
if(root == null)return 0;
int left = depth(root.left);
if(left == -1)return -1; //如果发现子树不平衡之后就没有必要进行下面的高度的求解了
int right = depth(root.right);//这两个return -1,是下面第三行return回来的
if(right == -1)return -1;//如果发现子树不平衡之后就没有必要进行下面的高度的求解了
if(left - right <(-1) || left - right > 1)
return -1;
else
return 1+(Math.max(left, right));
}
public boolean IsBalanced_Solution(TreeNode root) {
return depth(root) != -1;
}
}
public class Main{
public static void main(String[] args) {
TreeNode p1 = new TreeNode(10);//803
p1.left = new TreeNode(5);
p1.right = new TreeNode(15);
p1.left.left = new TreeNode(2);
p1.left.right = new TreeNode(7);
p1.left.right.left = new TreeNode(6);
p1.left.right.right = new TreeNode(8);
p1.left.right.right.right = new TreeNode(9);
// p1.right.left = new TreeNode(12);//删掉这两个就不是平衡二叉树了
// p1.right.right = new TreeNode(17);
Solution p = new Solution();
boolean b = p.IsBalanced_Solution(p1);
System.out.println("结果:"+b);
}
}