110. Balanced Binary Tree(easy)

最新推荐文章于 2024-04-30 17:41:57 发布

SourDumplings

最新推荐文章于 2024-04-30 17:41:57 发布

阅读量118

点赞数

分类专栏： LeetCode刷题练习

本文链接：https://blog.csdn.net/SourDumplings/article/details/88247510

版权

LeetCode刷题练习专栏收录该内容

111 篇文章 0 订阅

订阅专栏

Easy

106492FavoriteShare

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]:

Return true.

Example 2:

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

Return false.

/*
 * @Author: SourDumplings
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/balanced-binary-tree/
 * @Date: 2019-03-06 18:05:46
 */

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution
{
  public:
    bool isBalanced(TreeNode *root)
    {
        if (!root)
        {
            return true;
        }
        else if (abs(get_height(root->left) - get_height(root->right)) >= 2)
        {
            return false;
        }
        return isBalanced(root->left) && isBalanced(root->right);
    }
    int get_height(TreeNode *node)
    {
        if (!node)
        {
            return 0;
        }
        else
        {
            return max(get_height(node->left), get_height(node->right)) + 1;
        }
    }
};