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

public class Solution {
    public boolean IsBalanced_Solution(TreeNode root) {
        if(root==null)
            return true;
        int left=getHeight(root.left);
        int right=getHeight(root.right);
        
        if(Math.abs(right-left)<=1&&IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right))
          return true;

return false;  
    }
     public int getHeight(TreeNode node)
        {
            if(node==null)
                return 0;
            else
            {
                int left=getHeight(node.left);
                int right=getHeight(node.right);
                
                return Math.max(left,right)+1;
                
            }
            
        }
    
    
}