LeetCode NO.110 题解（递归法）

最新推荐文章于 2020-12-07 21:04:44 发布

Deamon Tree

最新推荐文章于 2020-12-07 21:04:44 发布

阅读量186

点赞数

分类专栏：技术问题文章标签： LeetCode

本文链接：https://blog.csdn.net/qq_33300570/article/details/91982599

版权

技术问题专栏收录该内容

16 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isBalanced(TreeNode root) {
        return deep(root)1=-1;
    }

    public int deep(TreeNode node){
        if(node ==null) return 0;
        int left = deep(node.left);
        int right = deep(node.right);
        if(left == -1) return -1;
        if(right == -1) return -1;
        return Math.abs(left-right)<2?Math.max(left,right)+1:-1;
    }
}