class Solution {
/*
* 题目:从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
*
* 思路:广搜
*
* */
public int[] levelOrder(TreeNode root) {
if (root == null) {
return new int[0];
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
List<Integer> res = new LinkedList<>();
while (!queue.isEmpty()) {
int n = queue.size();
for (int i = 0; i < n; i++) {
TreeNode node = queue.poll();
res.add(node.val);
if (node.left != null) {
queue.add(node.left);
}
if (node.right != null) {
queue.add(node.right);
}
}
}
int[] nums = new int[res.size()];
int index = 0;
for (int t : res) {
nums[index++] = t;
}
return nums;
}
}