Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> result = new ArrayList<>();
List<TreeNode> current = new ArrayList<>();
List<TreeNode> next = new ArrayList<>();
if(root != null) {
current.add(root);
}
while(!current.isEmpty()) {
List<Integer> currentResult = new ArrayList<>();
for(TreeNode node : current) {
currentResult.add(node.val);
if(node.left != null) {
next.add(node.left);
}
if(node.right != null) {
next.add(node.right);
}
}
result.add(currentResult);
current = next;
next = new ArrayList<>();
}
return result;
}
}