[剑指offer]平衡二叉树

题目描述

class Solution {
public:
int getDepth(TreeNode* pRoot){
if(pRoot==nullptr) return 0;
return 1+max(getDepth(pRoot->left),getDepth(pRoot->right));
}
bool IsBalanced_Solution(TreeNode* pRoot) {
if(pRoot==nullptr) return true;
int left=getDepth(pRoot->left);
int right=getDepth(pRoot->right);
if(left==right||left==right+1||right==left+1) return true;
return false;
}
};