描述
判断一棵树是否是平衡树
解决
递归
/**
* 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:
bool isBalanced(TreeNode* root) {
if (!root)
{
return true;
}
return (abs(help(root -> left) - help(root -> right)) <= 1 && isBalanced(root -> left) && isBalanced(root -> right));
}
int help(TreeNode *tmp)
{
if (!tmp)
return 0;
return 1 + max(help(tmp -> right), help(tmp -> left));
}
};