从零开始的LC刷题(26): Balanced Binary Tree 判断是否是二叉平衡树

最新推荐文章于 2024-04-10 15:25:11 发布

クロネコ黒猫

最新推荐文章于 2024-04-10 15:25:11 发布

阅读量134

点赞数

分类专栏： LEETCODE C++ 文章标签： lc

本文链接：https://blog.csdn.net/cyr429/article/details/90480197

版权

LEETCODE C++ 专栏收录该内容

134 篇文章 1 订阅

订阅专栏

原题：

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]:
    3
   / \
  9  20
    /  \
   15   7
Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:
       1
      / \
     2   2
    / \
   3   3
  / \
 4   4
Return false.

在递归求深度的过程中就可进行判断，当出现不平衡时就全部函数返回0，结果如下：

Success

Runtime: 4 ms, faster than 99.97% of C++ online submissions for Balanced Binary Tree.

Memory Usage: 16.7 MB, less than 92.08% of C++ online submissions for Balanced Binary Tree.

代码：

/**
 * 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 bala=true;
    bool isBalanced(TreeNode* root) {
        depth(root);
        return bala;
    }
    int depth(TreeNode *root){
        if (root==NULL||!bala){return 0;}
        int l=depth(root->left)+1;
        int r=depth(root->right)+1;
        if(abs(l-r)>1){bala=false;}
        if(l>=r){return l;}
        else return r;
    }
};

循环调用的话速度会快一点，因为可以直接终止循环。