-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution32_3.java
More file actions
43 lines (39 loc) · 1.26 KB
/
Copy pathsolution32_3.java
File metadata and controls
43 lines (39 loc) · 1.26 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
package nowcoder;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Queue;
public class solution32_3 {
public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> ret = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
((LinkedList<TreeNode>) queue).add(pRoot);
boolean reverse = false;
while(!queue.isEmpty())
{
int count = queue.size();
ArrayList<Integer> list = new ArrayList<>();
while(count-->0)
{
TreeNode t = queue.poll();
if(t==null)
{
continue;
}
list.add(t.val);
((LinkedList<TreeNode>) queue).add(t.left);
((LinkedList<TreeNode>) queue).add(t.right);
}
if(reverse)
{
Collections.reverse(list);
}
reverse = !reverse;
if(queue.size()!=0)
{
ret.add(list);
}
}
return ret;
}
}