FilesExpand file tree

 main

/

Code02_BalancedBinaryTree.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (34 loc) · 934 Bytes

 main

/

Code02_BalancedBinaryTree.java

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (34 loc) · 934 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

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

package class07;

// 测试链接：https://leetcode.com/problems/balanced-binary-tree

public class Code02_BalancedBinaryTree {

public static class TreeNode {

public int val;

public TreeNode left;

public TreeNode right;

TreeNode(int val) {

this.val = val;

}

}

public static class Info {

public boolean isBalanced;

public int height;

public Info(boolean i, int h) {

isBalanced = i;

height = h;

}

}

public static boolean isBalanced(TreeNode root) {

return process(root).isBalanced;

}

public static Info process(TreeNode root) {

if (root == null) {

return new Info(true, 0);

}

Info leftInfo = process(root.left);

Info rightInfo = process(root.right);

int height = Math.max(leftInfo.height, rightInfo.height) + 1;

boolean isBalanced = leftInfo.isBalanced && rightInfo.isBalanced

&& Math.abs(leftInfo.height - rightInfo.height) < 2;

return new Info(isBalanced, height);

}

}