zoukankan      html  css  js  c++  java
  • balcanced-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 ofevery node never differ by more than 1.

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

      

    拥抱明天! 不给自己做枷锁去限制自己。 别让时代的悲哀,成为你人生的悲哀。
  • 相关阅读:
    beagle ubuntu
    screen usage
    centos install nginx¢os 添加网易源
    心情舒畅,升级到u10.04了
    nginx 运行,检测
    联通宽带测速
    virtualenv usage
    linux 终端下utf8 和gbk相互转换
    [梦]2005725
    git install on centos
  • 原文地址:https://www.cnblogs.com/dd2hm/p/7507183.html
Copyright © 2011-2022 走看看