/
PopulateNextRightPointersInEachNode2.java
59 lines (48 loc) · 1.33 KB
/
PopulateNextRightPointersInEachNode2.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
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
// https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii
class Solution {
public Node connect(Node root) {
if (root == null) return root;
Queue<Node> queue = new ArrayDeque<>();
Queue<Node> temp = new ArrayDeque<>();
queue.add(root);
do {
Node last = null;
temp.addAll(queue);
queue.clear();
while (!temp.isEmpty()) {
Node n = temp.poll();
if (last != null) {
last.next = n;
}
last = n;
if (n.left != null) {
queue.add(n.left);
}
if (n.right != null) {
queue.add(n.right);
}
}
last.next = null;
} while (!queue.isEmpty());
return root;
}
}