leetcode-Balanced Binary Tree(2014.1.27)
来源:互联网 发布:linux vim怎么保存 编辑:程序博客网 时间:2024/06/06 07:41
/**
* 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) {
int dep;
return checkBalance(root,dep);
}
bool checkBalance(TreeNode* Node,int &depth){
if (Node==NULL){
depth=0;//递归到叶子的时候,高度为0
return true;
}
int leftDep,rightDep;
bool leftBalance=checkBalance(Node->left,leftDep);
bool rightBalance=checkBalance(Node->right,rightDep);左子和右子树平衡
depth=max(leftDep,rightDep)+1;
return leftBalance&&rightBalance&&(abs(leftDep-rightDep)<=1);//判断条件:左子和右子分别平衡,且高度相差不超过1
}
};
0 0
- leetcode-Balanced Binary Tree(2014.1.27)
- 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
- 【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
- LeetCode - Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- LeetCode | Balanced Binary Tree
- mac中安装maven3.2.1
- leetcode-Best Time to Buy and Sell Stock(2014.2.17)
- 比较详细Python正则表达式操作指南(re使用)[6]
- 【APIO2010】特别行动队
- 为程序员开一剂提高职业素养的良方
- leetcode-Balanced Binary Tree(2014.1.27)
- 希尔排序
- Json解析示例
- 比较详细Python正则表达式操作指南(re使用)[7]
- leetcode-Generate Parentheses (2014.4.18)
- 比较详细Python正则表达式操作指南(re使用)[8]
- PHP中GET与POST的区别
- 复数除法推导与C#实现
- 比较详细Python正则表达式操作指南(re使用)[9]