LeetCode 110 Balanced Binary Tree
LeetCode 110 Balanced Binary Tree
ShenduCC
发布于 2018-07-04 12:44:47
发布于 2018-07-04 12:44:47
文章被收录于专栏：算法修养
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.
判断是否为平衡二叉树
c++
class Solution {
public:
bool isBalanced(TreeNode* root) {
if(root == NULL) return true;
bool tagleft=true;bool tagright=true;
int dleft=0;int dright=0;
if(root->left!=NULL)
tagleft = isBalanced(root->left);
if(root->right!=NULL)
tagright = isBalanced(root->right);
if(root->left!=NULL)
dleft = deep(root->left);
if(root->right!=NULL)
dright = deep(root->right);
if(tagleft&&tagright&&abs(dleft-dright)<=1)
return true;
else
return false;
}
int deep(TreeNode* root)
{
int dleft=0;int dright=0;
if(root->left!=NULL)
dleft = deep(root->left);
if(root->right!=NULL)
dright = deep(root->right);
return max(dleft,dright)+1;
}
};本文参与 腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。
原始发表：2018-06-28 ，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读
腾讯云开发者
