从上往下打印出二叉树的每个节点,同层节点从左至右打印。
public class Solution {
Queue<TreeNode> queue = new LinkedList<>();
ArrayList<Integer> list = new ArrayList<>();
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
if(root == null){
return list;
}
queue.add(root);
while (queue.size() != 0){
list.add(queue.peek().val);
TreeNode temp = queue.poll();
if(temp.left != null){
queue.add(temp.left);
}
if(temp.right != null){
queue.add(temp.right);
}
}
return list;
}
}