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.
Example 1:
Given the following tree [3,9,20,null,null,15,7]
:
3 / \ 9 20 / \ 15 7
Return true.
有两种方法:
第一种方法就是对每一个子节点都运用findingdepth函数去找到他们的depth,以此来判定depth相减的差值。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int findingdepth(TreeNode* root){
if(root==NULL)
return 0;
return max(findingdepth(root->left),findingdepth(root->right))+1;
}
bool isBalanced(TreeNode* root) {
if(root==NULL)
return true;
int left = findingdepth(root->left);
int right = findingdepth(root->right);
return abs(left-right)<=1&&isBalanced(root->left)&&isBalanced(root->right);
}
};
方法二:但是根据正常思考后知道,其实我们不必要对每一个节点都去计算其depth,这样做的时间复杂度显然是O(n^2)。因此可以采用一次递归,在递归途中自底向上返回他是不是平衡的这样一个信息。
class solution {
public:
int dfsHeight (TreeNode *root) {
if (root == NULL) return 0;
int leftHeight = dfsHeight (root -> left);
if (leftHeight == -1) return -1;
int rightHeight = dfsHeight (root -> right);
if (rightHeight == -1) return -1;
if (abs(leftHeight - rightHeight) > 1) return -1;
return max (leftHeight, rightHeight) + 1;
}
bool isBalanced(TreeNode *root) {
return dfsHeight (root) != -1;
}
};