LeetCode: Balanced Binary Tree
2014-03-23 15:14
260 查看
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.
Solution:
还以为这种粗暴的递归无法通过测试呢,没想到直接accepted了!
那有没有什么好的算法实现呢?
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.
Solution:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { private: int getHeight(TreeNode *root){ if(!root) return 0; return 1+max(getHeight(root->left),getHeight(root->right)); } public: bool isBalanced(TreeNode *root) { if(!root) return true; else return (isBalanced(root->left) && isBalanced(root->right) && abs(getHeight(root->left) - getHeight(root->right)) <=1); } };
还以为这种粗暴的递归无法通过测试呢,没想到直接accepted了!
那有没有什么好的算法实现呢?
相关文章推荐
- 【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(JAVA)
- 110. Balanced Binary Tree [leetcode]
- LeetCode 110. Balanced Binary Tree
- [LeetCode] 110. Balanced Binary Tree ❤
- [Leetcode]@python 110. Balanced Binary Tree
- LeetCode "Balanced Binary Tree"
- LeetCode Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree
- LeetCode Balanced Binary Tree
- LeetCode刷题笔录Balanced Binary Tree
- Leetcode 110 Balanced Binary Tree
- LeetCode Balanced Binary Tree
- LeetCode-110. Balanced Binary Tree
- leetcode--110. Balanced Binary Tree
- LeetCode 110. Balanced Binary Tree