面试题32 - I. 从上到下打印二叉树

class Solution {
   public int[] levelOrder(TreeNode root) {
        if(root==null) return new int[]{};
        ArrayList<Integer> list = new ArrayList<>();
        LinkedList<TreeNode> treeNodes = new LinkedList<>();

        treeNodes.add(root);
        while (!treeNodes.isEmpty()) {
            TreeNode node = treeNodes.removeFirst();
            list.add(node.val);

            if (node.left != null) treeNodes.add(node.left);
            if (node.right != null) treeNodes.add(node.right);
        }

        int size = list.size();
        int[] res = new int[size];
        for (int i = 0; i < size; i++) {
            res[i] = list.get(i);
        }

        return res;
    }

}