/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int[] levelOrder(TreeNode root) {
if (root == null) {
return new int[]{};
}
// 定义一个队列
Queue<TreeNode> queue = new LinkedList<>();
// 定义一个列表,存放结点数据
List<Integer> list = new ArrayList<>();
// 先将根结点存放进入队列
queue.offer(root);
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
list.add(node.val);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
int[] res = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
res[i] = list.get(i);
}
return res;
}
}
剑指 Offer 32 - I. 从上到下打印二叉树
最新推荐文章于 2022-11-14 17:21:43 发布