LeetCode【110. 平衡二叉树】

class Solution {
    public boolean isBalanced(TreeNode root) {
        if(root == null)
        {
            return true;
        }
        else
        {
            if(depth(root.left) - depth(root.right) > 1 || depth(root.right) - depth(root.left) >1)
            {
                return false;
            }
            else 
                return isBalanced(root.left)&&isBalanced(root.right);
        }
    }
    public int depth(TreeNode root)
    {
        if(root == null)
        {
            return 0;
        }
        else
        {
            int left;
            int right;
            left = depth(root.left);
            right = depth(root.right);
            if(left>right)
            {
                return left+1;
            }
            else
            {
                return right+1;
            }
        }
    }
}