FilesExpand file tree

 master

/

BalancedBinaryTree.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

26 lines (20 loc) · 714 Bytes

 master

/

BalancedBinaryTree.java

Copy path

Top

File metadata and controls

• Code
• Blame

26 lines (20 loc) · 714 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

/**

* 平衡二叉树条件是左边是平衡，右边是平衡，且两边高度差相差不超过1

* 树的高度是所有子树的最大高度

*/

public class BalancedBinaryTree {

public boolean isBalanced(TreeNode root) {

return isBalanced(root, null);

}

private boolean isBalanced(TreeNode root, int[] height) {

if (root == null) {

return true;

}

int[] left = new int[1], right = new int[1];

boolean result = isBalanced(root.left, left) && isBalanced(root.right, right);

if (height != null) {

height[0] = Math.max(left[0], right[0]) + 1;

}

return result && Math.abs(left[0] - right[0]) <= 1;

}

}