2019-11-02 12:07:41 +08:00
|
|
|
# 55.2 平衡二叉树
|
|
|
|
|
|
2022-01-07 09:00:01 +00:00
|
|
|
[NowCoder](https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13\&tqId=11192\&tPage=1\&rp=1\&ru=/ta/coding-interviews\&qru=/ta/coding-interviews/question-ranking\&from=cyc\_github)
|
2019-11-02 12:07:41 +08:00
|
|
|
|
|
|
|
|
## 题目描述
|
|
|
|
|
|
|
|
|
|
平衡二叉树左右子树高度差不超过 1。
|
|
|
|
|
|
2022-01-07 09:00:01 +00:00
|
|
|
\
|
|
|
|
|
|
2019-11-02 12:07:41 +08:00
|
|
|
|
|
|
|
|
## 解题思路
|
|
|
|
|
|
|
|
|
|
```java
|
|
|
|
|
private boolean isBalanced = true;
|
|
|
|
|
|
|
|
|
|
public boolean IsBalanced_Solution(TreeNode root) {
|
|
|
|
|
height(root);
|
|
|
|
|
return isBalanced;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private int height(TreeNode root) {
|
|
|
|
|
if (root == null || !isBalanced)
|
|
|
|
|
return 0;
|
|
|
|
|
int left = height(root.left);
|
|
|
|
|
int right = height(root.right);
|
|
|
|
|
if (Math.abs(left - right) > 1)
|
|
|
|
|
isBalanced = false;
|
|
|
|
|
return 1 + Math.max(left, right);
|
|
|
|
|
}
|
|
|
|
|
```
|
