从上到下打印二叉树

从上到下打印二叉树

	public int[] levelOrder(TreeNode root) {
        if (root == null) return new int[0];
        LinkedList<Integer> out = new LinkedList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                out.add(node.val);
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
        }
        int[] res = new int[out.size()];
        for (int i = 0; i < out.size(); i++) {
            res[i] = out.get(i);
        }
        return res;
    }