-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree
43 lines (40 loc) · 1.12 KB
/
Tree
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
//Level order traversal
/**
* Definition for a binary tree node.
* 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;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> result =new ArrayList<>();
if(root==null) return result;
Queue<TreeNode> q=new LinkedList<>();
q.add(root);
while(!q.isEmpty()){
int size=q.size();
List<Integer> currlevel=new ArrayList<>();
for(int i=0;i<size;i++){
TreeNode curr=q.remove();
currlevel.add(curr.val);
if(curr.left!=null){
q.add(curr.left);
}
if(curr.right!=null){
q.add(curr.right);
}
}
result.add(currlevel);
}
return result;
}
}