输入一棵二叉树，判断该二叉树是否是平衡二叉树。

题目描述

输入一棵二叉树，判断该二叉树是否是平衡二叉树。

Code

/*public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;    public TreeNode(int val) {        this.val = val;    }}*/public class Solution {    public boolean IsBalanced_Solution(TreeNode root) {        if(root==null) return true;        else{            int l=deeptree(root.left);            int r=deeptree(root.right);            if(l-r>1||r-l>1) return false;            return IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right);        }    }    public int deeptree(TreeNode root){        int deep=0;        if(root!=null){            int l=deeptree(root.left);            int r=deeptree(root.right);            deep=l>r?l+1:r+1;        }        return deep;    }}