-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryTreeLevelOrderTraversal.java
More file actions
53 lines (46 loc) · 1.29 KB
/
BinaryTreeLevelOrderTraversal.java
File metadata and controls
53 lines (46 loc) · 1.29 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
package t102;
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
public class BinaryTreeLevelOrderTraversal {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(root==null){
return res;
}
List<TreeNode> list = new ArrayList<TreeNode>();
list.add(root);
while(true){
if(list.isEmpty()){
break;
}
List<TreeNode> tmp = new ArrayList<TreeNode>();
List<Integer> intI = new ArrayList<Integer>();
for(int i=0;i<list.size();i++){
TreeNode tm = list.get(i);
if(tm.left!=null){
tmp.add(tm.left);
}
if(tm.right!=null){
tmp.add(tm.right);
}
intI.add(tm.val);
}
list = tmp;
res.add(intI);
}
return res;
}
}