平衡二叉树的判断

public class Solution {
    
    private boolean isAVL = true;
    
    public boolean IsBalanced_Solution(TreeNode root) {
        
        if (root == null)
            return true;
        
        depth(root);
        return isAVL;
    }
    
    public int depth(TreeNode root) {
        if (root == null)
            return 0;
        int leftDepth = depth(root.left);
        int rightDepth = depth(root.right);
        if (leftDepth - rightDepth > 1 || leftDepth - rightDepth < -1) {
            isAVL = false;
        }
        return leftDepth>rightDepth ? leftDepth+1:rightDepth+1;
    }
}