-
Notifications
You must be signed in to change notification settings - Fork 0
/
Binary Tree Level Order Traversal.java
47 lines (40 loc) · 1.17 KB
/
Binary Tree Level Order Traversal.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
/**
* 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;
* }
* }
*/
//https://leetcode.com/problems/binary-tree-level-order-traversal/description/?fbclid=IwAR2CHmQP24AqHhluHV_pomxKGNQzmV7tsJfXpbi9DSel-1N8GJofl9G6V04
class Solution {
List<List<Integer>> list=new ArrayList<>();
public void bfs(TreeNode root){
Queue<TreeNode> q=new LinkedList<>();
if(root!=null){
q.add(root);
}
while(!q.isEmpty()){
int size=q.size();
ArrayList<Integer>l=new ArrayList<>();
for(int i=0;i<size;i++){
TreeNode node=q.remove();
l.add(node.val);
if(node.left!=null)q.add(node.left);
if(node.right!=null)q.add(node.right);
}
list.add(l);
}
}
public List<List<Integer>> levelOrder(TreeNode root) {
bfs(root);
return list;
}
}