110. Balanced Binary Tree

最新推荐文章于 2020-08-17 08:27:00 发布

csdnzhaocsdn

最新推荐文章于 2020-08-17 08:27:00 发布

阅读量64

点赞数

分类专栏：树 LeetCode 递归

本文链接：https://blog.csdn.net/qq_39360744/article/details/104122636

版权

LeetCode 同时被 3 个专栏收录

109 篇文章 0 订阅

订阅专栏

树

12 篇文章 0 订阅

订阅专栏

递归

6 篇文章 0 订阅

订阅专栏

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as:

a binary tree in which the left and right subtrees of every node differ in height by no more than 1.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

/
9 20
/
15 7
Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

3 3
/
4 4
Return false.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/balanced-binary-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//自顶向下

/**
 * 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) {
        if(root == null) return true;
        return (Math.abs(depth(root.left)-depth(root.right))<=1) && isBalanced(root.left) && isBalanced(root.right);
    }
    public int depth(TreeNode root){
        if(root == null) return 0;
        return (Math.max(depth(root.left),depth(root.right))) + 1;
    }
}