Leetcode Balanced Binary Tree
2015-05-18 17:08
323 查看
判断一个二叉树是否是高度平衡的。高度平衡的定义是:对每一个节点,其左儿子树与右儿子树的高度差小于等于1。8ms
int height(struct TreeNode* node) {
if (!node) return 0;
int l = height(node->left);
if (l == -1) return -1;
int r = height(node->right);
if (r == -1 || abs(l - r) > 1)
return -1;
return l > r ? l+1 : r+1;
}
bool isBalanced(struct TreeNode* root) {
return height(root) >= 0 ? true : false;
}
int height(struct TreeNode* node) {
if (!node) return 0;
int l = height(node->left);
if (l == -1) return -1;
int r = height(node->right);
if (r == -1 || abs(l - r) > 1)
return -1;
return l > r ? l+1 : r+1;
}
bool isBalanced(struct TreeNode* root) {
return height(root) >= 0 ? true : false;
}
相关文章推荐
- LeetCode--Balanced Binary Tree
- Leetcode 110 Balanced Binary Tree
- Convert Sorted List to Balanced Binary Search Tree leetcode
- leetcode 110 Balanced Binary Tree
- LeetCode 110 Balanced Binary Tree
- Leetcode Balanced Binary Tree
- leetcode——Balanced Binary Tree
- leetcode 110 Balanced Binary Tree
- leetCode 110.Balanced Binary Tree (平衡二叉树) 解题思路和方法
- leetcode_110. Balanced Binary Tree 判断一棵二叉树是否为平衡二叉树
- [LeetCode]110. Balanced Binary Tree
- 4.33 leetcode -33 balanced-binary-tree
- 【LeetCode】Balanced Binary Tree
- 树和递归(一)[leetcode]Balanced Binary Tree
- [LeetCode]104. Maximum Depth of Binary Tree&110. Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [LeetCode] Balanced Binary Tree
- [Leetcode 110, Easy] Balanced Binary Tree
- LeetCode(24)-Balanced Binary Tree
- [leetcode 110] Balanced Binary Tree