forked from yubinbai/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
72 lines (63 loc) · 2.22 KB
/
Solution.java
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
67
68
69
70
71
72
import java.util.*;
public class Solution {
public void connect(TreeLinkNode root) {
if (root == null) return;
TreeLinkNode parent = root, curr = null, nextLevel = null;
TreeLinkNode currLevel = root.left != null ? root.left : root.right;
while (currLevel != null) {
curr = currLevel;
while (parent != null) {
if (curr.left != null && nextLevel == null) nextLevel = curr.left;
if (curr.right != null && nextLevel == null) nextLevel = curr.right;
if (curr == parent.left) {
if (parent.right != null) {
curr.next = parent.right;
curr = parent.right;
} else {
parent = parent.next;
}
} else if (curr == parent.right) {
parent = parent.next;
if (parent == null) continue;
if (parent.left != null) {
curr.next = parent.left;
curr = parent.left;
} else if (parent.right != null) {
curr.next = parent.right;
curr = parent.right;
}
} else {
parent = parent.next;
}
}
parent = currLevel;
currLevel = nextLevel;
nextLevel = null;
}
}
public static void main(String[] args) {
TreeLinkNode e = new TreeLinkNode(1);
e.left = new TreeLinkNode(1);
e.right = new TreeLinkNode(2);
e.left.left = new TreeLinkNode(3);
e.left.right = new TreeLinkNode(4);
e.right.left = new TreeLinkNode(5);
e.right.right = new TreeLinkNode(6);
Solution s = new Solution();
s.connect(e);
s.printList(e.left);
s.printList(e.left.left);
}
public void printList(TreeLinkNode e) {
while (e != null) {
System.out.format("%d ", e.val);
e = e.next;
}
System.out.println("");
}
}
class TreeLinkNode {
int val;
TreeLinkNode left, right, next;
TreeLinkNode(int x) { val = x; }
}