LeetCode 110. Balanced Binary Tree（二叉树）

最新推荐文章于 2021-04-01 16:53:27 发布

da_kao_la

最新推荐文章于 2021-04-01 16:53:27 发布

阅读量129

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java Easy 二叉树

本文链接：https://blog.csdn.net/da_kao_la/article/details/94614460

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

题目来源：https://leetcode.com/problems/balanced-binary-tree/

问题描述

110. Balanced Binary Tree

Easy

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 depth of the two subtrees of every node never differ by 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]:

/ \

2 2

/ \

3 3

/ \

4 4

Return false.

------------------------------------------------------------

题意

给定一个二叉树，判断是否是平衡二叉树。平衡二叉树的定义是所有叶子节点的高度最多相差1.

------------------------------------------------------------

思路

递归求解子树的高度

------------------------------------------------------------

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int getDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftDepth = getDepth(root.left), rightDepth = getDepth(root.right);
        if (leftDepth == -2 || rightDepth == -2) {
            return -2;
        }
        if (leftDepth - rightDepth < -1 || leftDepth - rightDepth > 1) {
            return -2;
        }
        return (leftDepth>rightDepth? leftDepth:rightDepth)+1;
    }
    
    public boolean isBalanced(TreeNode root) {
        if (getDepth(root) == -2) {
            return false;
        } else {
            return true;
        }
    }
}