Binary Tree Level Order Traversal的java实现

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

[
  [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) 
    {
        LinkedList<List<Integer>> l=new LinkedList<List<Integer>>();
        LinkedList<TreeNode> q=new LinkedList<TreeNode>();
        q.addLast(root);
        TreeNode N;
        if(root==null)
            return l;
        while(!q.isEmpty())
        {  
            List<Integer> VNode=new LinkedList<Integer>();
            int k=q.size();
            while(k>0)
            {
                k--;
                N=q.remove();
                VNode.add(N.val);
                if(N.left!=null)
                    q.addLast(N.left);
                if(N.right!=null)
                    q.addLast(N.right);
                    
            }
           
            l.add(VNode);
        }
        return l;
    }
}