首页 > 代码库 > 【LeetCode】Balanced Binary Tree
【LeetCode】Balanced Binary Tree
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、左子树满足平衡条件
2、右子树满足平衡条件
3、左右子树深度差不超过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: bool isBalanced(TreeNode *root) { if(root == NULL) return true; if(isBalanced(root->left) && isBalanced(root->right)) { int left = height(root->left); int right = height(root->right); if(fabs(left-right) <= 1) return true; else return false; } else return false; } int height(TreeNode* root) { if(root == NULL) return 0; int left = height(root->left); int right = height(root->right); return max(left,right)+1; }};
【LeetCode】Balanced Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。