-
Notifications
You must be signed in to change notification settings - Fork 0
/
116.java
39 lines (39 loc) · 1.13 KB
/
116.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
/**
* Definition for binary tree with next pointer.
* public class TreeLinkNode {
* int val;
* TreeLinkNode left, right, next;
* TreeLinkNode(int x) { val = x; }
* }
*/
public class Solution {
public void connect(TreeLinkNode root) {
if(root == null) return ;
root.next = null;
TreeLinkNode parent = root;
while(parent != null) {
TreeLinkNode ite = parent;
TreeLinkNode first= null, last =null;
while(ite!= null) {
if(ite.left != null) {
if( first == null) {
first = ite.left;
} else {
last.next = ite.left;
}
last = ite.left;
}
if(ite.right!= null) {
if( first == null) {
first = ite.right;
} else {
last.next = ite.right;
}
last = ite.right;
}
ite = ite.next;
}
parent = first;
}
}
}