题目链接:https://leetcode-cn.com/problems/balanced-binary-tree/
题目如下:
/**
* 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) {
return dfs(root)>=0;
}
int dfs(TreeNode* root){
if(root==NULL) return 0;
int left=dfs(root->left);//因为要计算左右孩子的高度,递归需要整型来计算,所以,dfs函数不能返回值为bool
int right=dfs(root->right);
if(left>=0&&right>=0&&abs(left-right)<=1) return max(left,right)+1;
else return -1;
}
};