Problem:
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,#,#,15,7}
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
Solution:
/**
* Definition for binary tree
* 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<>();
if(root==null)
return result;
List<TreeNode> qlist = new ArrayList<>();
qlist.add(root);
while(!qlist.isEmpty())
{
int size = qlist.size();
ArrayList<Integer> list = new ArrayList<>();
while(size-->0)
{
TreeNode t = qlist.remove(0);
list.add(t.val);
if(t.left!=null)
qlist.add(t.left);
if(t.right!=null)
qlist.add(t.right);
}
result.add(list);
}
return result;
}
}
* Definition for binary tree
* 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<>();
if(root==null)
return result;
List<TreeNode> qlist = new ArrayList<>();
qlist.add(root);
while(!qlist.isEmpty())
{
int size = qlist.size();
ArrayList<Integer> list = new ArrayList<>();
while(size-->0)
{
TreeNode t = qlist.remove(0);
list.add(t.val);
if(t.left!=null)
qlist.add(t.left);
if(t.right!=null)
qlist.add(t.right);
}
result.add(list);
}
return result;
}
}