AcWing打卡活动
《剑指Offer》打卡活动
周三第九题 不分行从上往下打印二叉树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
* 思路
* 需要提前想到使用队列完成操作
* a. 将父节点输出
* b. 将儿子节点存入队列中
* 循环a, b即可
*
*
*/
class Solution {
public List<Integer> printFromTopToBottom(TreeNode root) {
List<Integer> resultList = new ArrayList();
TreeNode node;
Queue<TreeNode> nodeQueue = new LinkedList();
nodeQueue.offer(root);
while(nodeQueue.peek() != null) {
node = nodeQueue.poll();
resultList.add(node.val);
if(node.left != null) {
nodeQueue.offer(node.left);
}
if(node.right != null) {
nodeQueue.offer(node.right);
}
}
return resultList;
}
}