zoukankan      html  css  js  c++  java
  • [LeetCode] Balanced Binary Tree

    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.

    判断一棵树是否是高度平衡的二叉树,高度平衡的二叉树的定义是:二叉树的每个节点两个子树的深度差不超过1.

    所以需要我们递归求出每个节点的左右子树的最大深度。然后比较判断。

    /**
     * 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 == nullptr)
                return true;
            int left = depth(root->left);
            int right = depth(root->right);
            return abs(left - right) <= 1 && isBalanced(root->left) && isBalanced(root->right);
            
        }
        int depth(TreeNode* root) {
            if (root == nullptr)
                return 0;
            return max(depth(root->left), depth(root->right)) + 1;
        }
    };
    // 9 ms
  • 相关阅读:
    P4568 [JLOI2011]飞行路线 最短路+分层图
    虚树
    点分治
    P2157 [SDOI2009]学校食堂 状压DP
    P2767 树的数量 DP | 组合数学
    CF348D LGV引理
    LGV引理
    P3647 [APIO2014]连珠线 换根DP
    第3章 决策树
    USDT/BTC/ETC/HT的解释
  • 原文地址:https://www.cnblogs.com/immjc/p/7554702.html
Copyright © 2011-2022 走看看