输入一棵二叉树,判断该二叉树是否是平衡二叉树。
在这里,我们只需要考虑其平衡性,不需要考虑其是不是排序二叉树
我的代码:
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if (!pRoot) return 0;
queue<TreeNode*> q;
int count = 0;
q.push(pRoot);
while(!q.empty()) {
int size = q.size();
while(size--){
TreeNode *temp = q.front();
q.pop();
if(temp->left) q.push(temp->left);
if(temp->right) q.push(temp->right);
}
count++;
}
return count;
}
bool IsBalanced_Solution(TreeNode* pRoot) {
if(!pRoot) return true;
if(TreeDepth(pRoot) == 1) return true;
return IsBalanced_Solution(pRoot->left) && IsBalanced_Solution(pRoot->right) && abs(TreeDepth(pRoot->left)-TreeDepth(pRoot->right)) <= 1;
}
};
大佬的代码(已剪枝):
public class Solution {
public boolean IsBalanced_Solution(TreeNode root) {
return getDepth(root) != -1;
}
private int getDepth(TreeNode root) {
if (root == null) return 0;
int left = getDepth(root.left);
if (left == -1) return -1;
int right = getDepth(root.right);
if (right == -1) return -1;
return Math.abs(left - right) > 1 ? -1 : 1 + Math.max(left, right);
}
}