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; }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> result=new LinkedList();
if(root==null)
return result;
Queue<Object[]> queue=new LinkedList();
queue.offer(new Object[]{root,0});
while(!queue.isEmpty()){
Object[] val=queue.poll();
TreeNode node=(TreeNode)val[0];
int level=(Integer)val[1];
if(level==result.size())
result.add(new ArrayList());
result.get(level).add(node.val);
if(node.left!=null)
queue.offer(new Object[]{node.left,level+1});
if(node.right!=null)
queue.offer(new Object[]{node.right,level+1});
}
return result;
}
}