# 平衡二叉树习题

31 篇文章 1 订阅
27 篇文章 0 订阅

### 1、给定一个二叉树，判断它是否是高度平衡的二叉树。

3
/ \
9  20
/  \
15   7

1
/ \
2   2
/ \
3   3
/ \
4   4

class Solution {
public boolean isBalanced(TreeNode root) {
return recur(root) != -1;
}

private int recur(TreeNode root) {
if (root == null) return 0;
int left = recur(root.left);
if(left == -1) return -1;
int right = recur(root.right);
if(right == -1) return -1;
return Math.abs(left - right) < 2 ? Math.max(left, right) + 1 : -1;
}
}

class Solution {
private:
// Recursively obtain the height of a tree. An empty tree has -1 height
int height(TreeNode* root) {
// An empty tree has height -1
if (root == NULL) {
return -1;
}
return 1 + max(height(root->left), height(root->right));
}
public:
bool isBalanced(TreeNode* root) {
// An empty tree satisfies the definition of a balanced tree
if (root == NULL) {
return true;
}

// Check if subtrees have height within 1. If they do, check if the
// subtrees are balanced
return abs(height(root->left) - height(root->right)) < 2 &&
isBalanced(root->left) &&
isBalanced(root->right);
}
};
• 0
点赞
• 0
收藏
觉得还不错? 一键收藏
• 打赏
• 0
评论
02-12 1478
06-21 781
07-29 1397
12-29 4374
07-12
01-16 981
05-18 676
01-02 1891
05-21 815

### “相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

¥1 ¥2 ¥4 ¥6 ¥10 ¥20

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。