剑指offer 32-1 32-2从上到下打印二叉树

1、从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。

例如:
给定二叉树: [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; }
 * }
 */
class Solution {
    public int[] levelOrder(TreeNode root) {
        List<Integer> list=new ArrayList<>();
        if(root==null)
            return new int[]{};
        Queue<TreeNode> queue=new LinkedList<TreeNode>();
        queue.add(root);
        while(!queue.isEmpty())
        {
            TreeNode nownode=queue.poll();
            if (nownode.left!=null)
            {
                queue.add(nownode.left);
            }
            if (nownode.right!=null)
            {
                queue.add(nownode.right);
            }
            list.add(nownode.val);
        }
        int[] lay=new int[list.size()];
        for (int i = 0; i < list.size(); i++) {
            lay[i]=list.get(i);
        }
        return lay;
    }
}

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

例如:
给定二叉树: [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; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> orderlist=new LinkedList<>();
        if (root==null) {
            return orderlist;
        }
        Queue<TreeNode> queue=new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty())
        {
            int num=queue.size();
            List<Integer> list=new ArrayList<>();
            for (int i = 0; i <num ; i++) {
                TreeNode cur=queue.poll();
                list.add(cur.val);
                if (cur.left!=null) {
                    queue.add(cur.left);
                }
                if (cur.right!=null)
                {
                    queue.add(cur.right);
                }
            }
            orderlist.add(list);
        }
        return orderlist;
    }
}