AcWing 43. 不分行从上往下打印二叉树
原题链接
简单
作者:
LangB
,
2020-11-09 13:17:46
,
所有人可见
,
阅读 275
AcWing 43. 不分行从上往下打印二叉树
class Solution {
public List<Integer> printFromTopToBottom(TreeNode root) {
List<Integer> res = new ArrayList<>();
if (root == null) {
return res;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
res.add(node.val);
}
return res;
}
}