FilesExpand file tree

 master

/

BalancedBinaryTree.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

28 lines (25 loc) · 698 Bytes

 master

/

BalancedBinaryTree.java

Top

File metadata and controls

• Code
• Blame

28 lines (25 loc) · 698 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

/**

* Given a binary tree, determine if it is height-balanced.

*

* For this problem, a height-balanced binary tree is defined as a binary tree

* in which the depth of the two subtrees of every node never differ by more

* than 1.

*

*/

public class BalancedBinaryTree {

public boolean isBalanced(TreeNode root) {

return determine(root) >= 0 ? true : false;

}

private int determine(TreeNode root) {

if (root == null) {

return 0;

} else {

int leftDepth = determine(root.left);

int rightDepth = determine(root.right);

if (leftDepth < 0 || rightDepth < 0

|| Math.abs(leftDepth - rightDepth) > 1)

return -1;

return Math.max(leftDepth, rightDepth) + 1;

}

}

}