题目:
从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回:
[3,9,20,15,7]
提示:
节点总数 <= 1000
思路:
层次遍历二叉树
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.util.LinkedList;
import java.util.List;
import java.util.ArrayList;
class Solution {
public int[] levelOrder(TreeNode root) {
if(root == null) {
return new int[0];
}
LinkedList<TreeNode> queue = new LinkedList<>();
List<Integer> vals = new ArrayList<>();
queue.offer(root);
TreeNode cur = null;
while(!queue.isEmpty()) {
cur = queue.poll();
vals.add(cur.val);
if(cur.left != null) {
queue.offer(cur.left);
}
if(cur.right != null) {
queue.offer(cur.right);
}
}
return vals.stream().mapToInt(Integer::valueOf).toArray();
}
}