Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
42 lines (34 loc) · 1.12 KB

File metadata and controls

42 lines (34 loc) · 1.12 KB
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
class Problem110 {
public static void main(String[] args) {
Problem110 p = new Problem110();
TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.left.left = new TreeNode(3);
root.left.left.left = new TreeNode(4);
root.left.left.left.left = new TreeNode(5);
System.out.println(p.isBalanced(root));
}
public boolean isBalanced(TreeNode root) {
if (root == null) return true;
int rightHeight = height(root.right);
int leftHeight = height(root.left);
if (rightHeight <0 || leftHeight <0) {
return false;
}
if (Math.abs(leftHeight - rightHeight) <= 1) {
return true;
}
return false;
}
int height(TreeNode root) {
if (root == null) return 0;
int leftHeight = height(root.left);
int rightHeight = height(root.right);
int err = Math.abs(leftHeight - rightHeight);
if ( err > 1 || err < 0) {
return Integer.MIN_VALUE;
}
int val = Math.max(leftHeight, rightHeight) + 1;
return val;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.