用队列储存每个不为空的节点
class Solution {
public int[] levelOrder(TreeNode root) {
if(root == null) return new int[]{};
Queue<TreeNode> queue = new LinkedList<>();
List<Integer> list = new ArrayList<>();
queue.add(root);
while(!queue.isEmpty()){
TreeNode node = queue.poll();
list.add(node.val);
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
int[] nums = new int[list.size()];
for(int i = 0; i < list.size(); i++){
nums[i] = list.get(i);
}
return nums;
}
}