从上到下按层打印二叉树，同一层的节点按从左到右的顺序打印，每一层打印到一行

 

/**
 * 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 ArrayList();
        Queue<TreeNode> queue=new LinkedList<>();
        if(root==null) return result;
        TreeNode p;
        queue.offer(root);
        while(!queue.isEmpty()){
            ArrayList<Integer> list=new ArrayList();
            int size=queue.size();
            for(int i=0;i<size;i++){
                p=queue.poll();
                if(p.left!=null) queue.offer(p.left);
                if(p.right!=null) queue.offer(p.right);
                list.add(p.val);
            }

            result.add(list); 
        }
        return result;
    }
}