平衡二叉树判断

   public boolean IsBalanced_Solution(TreeNode root) {
        if (root==null){
            return true;
        }
        return Math.abs(getDepth(root.left)-getDepth(root.right))>1?false:true&&IsBalanced_Solution(root.left)&&IsBalanced_Solution(root.right);
    }
    public int getDepth(TreeNode node){
        if (node==null){
            return 0;
        }
        return Math.max(getDepth(node.left),getDepth(node.right))+1;
    }