-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIsBalancedTree.java
More file actions
66 lines (55 loc) · 1.89 KB
/
Copy pathIsBalancedTree.java
File metadata and controls
66 lines (55 loc) · 1.89 KB
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package tree;
import org.junit.Test;
import utils.TreeNodeUtil;
/**
* @Author: wei1
* @Date: Create in 2018/11/22 14:13
* @Description:
*/
public class IsBalancedTree {
private static class ReturnData {
private int gaodu;
private boolean isBalancedTree;
public ReturnData(int gaodu, boolean isBalancedTree) {
this.gaodu = gaodu;
this.isBalancedTree = isBalancedTree;
}
}
public ReturnData isBalanced(TreeNode head) {
if (head == null) {
return new ReturnData(0, true);
}
ReturnData leftData = isBalanced(head.left);
if (!leftData.isBalancedTree) {
return new ReturnData(0, false);
}
ReturnData rightData = isBalanced(head.right);
if (!rightData.isBalancedTree) {
return new ReturnData(0, false);
}
if (Math.abs(rightData.gaodu - leftData.gaodu) > 1) {
return new ReturnData(0, false);
}
return new ReturnData(Math.max(rightData.gaodu, leftData.gaodu) + 1, true);
}
@Test
public void test() {
TreeNode head = TreeNodeUtil.getTree();
TreeNode root = new TreeNode(1);
root.left = new TreeNode(1);
root.left.right = new TreeNode(1);
root.left.right.left = new TreeNode(1);
root.left.right.right = new TreeNode(1);
root.left.left = new TreeNode(1);
root.left.left.right = new TreeNode(1);
root.left.left.left = new TreeNode(1);
root.left.left.left.right = new TreeNode(1);
root.right = new TreeNode(1);
root.right.left = new TreeNode(1);
root.right.right = new TreeNode(1);
root.right.right.left = new TreeNode(1);
// ReturnData balanced = isBalanced(head);
ReturnData balanced = isBalanced(root);
System.out.println(balanced.isBalancedTree + " : " + balanced.gaodu);
}
}