题目:
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 left and right subtrees of every node differ in height by no more than 1.
Example 1:
Input: root = [3,9,20,null,null,15,7] Output: true
Example 2:
Input: root = [1,2,2,3,3,null,null,4,4] Output: false
Example 3:
Input: root = [] Output: true
Constraints:
- The number of nodes in the tree is in the range
[0, 5000]
. -10^4 <= Node.val <= 10^4
思路:
常规思路的话是另设一个函数来计算深度,对于每个node的左右子使用函数,如果不符合规则就返回false。这种对于每个node都需要走一遍tree,如果是单边树的话,复杂度会达到N方。这里介绍一种复杂度为N的思路:同样的用另一个函数,但是这个DFS里面,如果我们发现当前node不符合规则或者左右不符合规则就返回-1,否则就返回最大深度,这样主函数中只要验证返回的是不是-1即可。
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
if(!root)
return true;
return check(root)!=-1;
}
private:
int check(TreeNode* root)
{
if(!root)
return 0;
int left=check(root->left);
int right =check(root->right);
if(left==-1||right==-1||abs(left-right)>1)
return -1;
return max(left,right)+1;
}
};