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

topic

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

例如:
给定二叉树: [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
返回：

[3,9,20,15,7]

提示：

节点总数 <= 1000

answer

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
class Solution {
    public int[] levelOrder(TreeNode root)
        {
            if(root == null) 
             {
                int[] a = {};
                return a;
            }
           Queue<TreeNode> arrayBlockingQueue = new ArrayBlockingQueue<TreeNode>(1000);
            ArrayList<Integer> result = new ArrayList<>();
            arrayBlockingQueue.add(root);
            while (!arrayBlockingQueue.isEmpty())
            {
                TreeNode treeNode = arrayBlockingQueue.poll();
                result.add(treeNode.val);
                if(treeNode.left != null) arrayBlockingQueue.add(treeNode.left);
                if(treeNode.right != null) arrayBlockingQueue.add(treeNode.right);
            }
            int[] sz = new int[result.size()];
            for(int i = 0 ;i < result.size(); i ++)
            {
                sz[i] = result.get(i);
            }
            return sz;
        }
}