Niuke-top101-bm36

public class Solution {
    
    boolean sign = true;
    public boolean IsBalanced_Solution(TreeNode root) {
    
        TreeDepth(root);
        return sign;
    }
    
    public int TreeDepth(TreeNode t){
    
        if(t == null)
            return 0;
        int l = TreeDepth(t.left);
        if(l == -1)
            return -1;
        int r = TreeDepth(t.right);
        if(r == -1)
            return -1;
        if(Math.abs(l - r) > 1){
    
            sign = false;
            return -1;
        }
        return Math.max(l,r) + 1;
    }
}