题解 | #平衡二叉树#
平衡二叉树
http://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222
class Solution {
public:
bool IsBalanced_Solution(TreeNode* rt) {
if(rt==NULL) return true;
int depl=dep(rt->left);
int depr=dep(rt->right);
if(abs(depl-depr)>1) return false;
return IsBalanced_Solution(rt->left)&&IsBalanced_Solution(rt->right);
}
int dep(TreeNode* rt){
if(rt==NULL) return 0;
return 1+max(dep(rt->left),dep(rt->right));
}
}; 