剑指offer_39

public class  {
    private boolean isBalance = true;
    
    private int depth(TreeNode node){
        if(node == null){
            return 0;
        }
        int left = depth(node.left);
        int right = depth(node.right);
        if(Math.abs(left - right) > 1){
            isBalance = false;
        }
        
        
        return left > right ? left + 1 : right + 1;
    }
    
    public boolean IsBalanced_Solution(TreeNode root) {
        if(root == null){
            return true;
        }
        depth(root);
        
        return isBalance;
    }
    
}