public:
map<TreeNode*,int>arr;//用这个不会数组越界,并且数字相同影响也不大
int dfs(TreeNode* root){
if(!root){
return 0;
}
int left=dfs(root->left);
int right=dfs(root->right);
return arr[root]=max(left,right)+1;
}
bool checkBalance(TreeNode* root){
if(!root)return true;
return abs(arr[root->left]-arr[root->right])<=1&&checkBalance(root->left)&&checkBalance(root->right);
}
bool IsBalanced_Solution(TreeNode* pRoot) {
dfs(pRoot);
return checkBalance(pRoot);
}
};