Balanced Binary Tree
来源:互联网 发布:打开文件软件下载 编辑:程序博客网 时间:2024/06/06 12:13
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.
------------------
/**
* 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) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int h = 0;
return isBalanced(root, h);
}
private:
bool isBalanced(TreeNode *root, int &h) {
if (root == NULL) {
h = 0;
return true;
}
if (root->left == NULL && root->right == NULL) {
h = 1;
return true;
}
int l = 0, r = 0;
bool ret = true;
if (!isBalanced(root->left, l) || !isBalanced(root->right, r)) ret = false;
h = max(l, r) + 1;
return ret && abs(l - r) <= 1;
}
};
- Balanced binary tree 扩展
- LeetCode: Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [Leetcode] Balanced Binary Tree
- LeetCode : Balanced Binary Tree
- LeetCode Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- Balanced Binary Tree
- Balanced Binary Tree
- 【leetcode】Balanced Binary Tree
- Balanced Binary Tree
- [LeetCode]Balanced Binary Tree
- Balanced Binary Tree
- Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [Leetcode]Balanced Binary Tree
- [leetcode]Balanced Binary Tree
- Paste Deployment简介以及cinder-api-paste.ini的解析(1)
- UITableView学习心得
- J2EE——servlet
- 标签的使用
- c++ this 指针详解
- Balanced Binary Tree
- jython LookupError: unknown encoding 'ms936' 解决办法
- C++编译器与链接器工作原理
- ZeroMQ(java)之Requerst/Response模式
- spring jdbc mapper
- C语言涉及地址, 指针等符号的英语读法,有助于语法理解
- ZeroMQ(java)之Publish/Subscribe模式
- 跳槽风波的感悟
- 智能机的崛起与移动时代