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

    class Solution {
    public:
        int depth(TreeNode *root){
            if(!root) return 0;
            return 1+max(depth(root->left),depth(root->right));
        }
    
        bool isBalanced(TreeNode *root) {
            if(!root) return true;
            return abs(depth(root->left)-depth(root->right))<=1 && isBalanced(root->left) && isBalanced(root->right);
        }
    };
  • 相关阅读:
    瀑布流
    轮播图
    封装动画的函数
    回到顶部带动画
    动画setInterval
    模拟滚动条
    放大镜
    刷新
    cookie
    拖拽
  • 原文地址:https://www.cnblogs.com/xiongqiangcs/p/3810922.html
Copyright © 2011-2022 走看看