题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.*;
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> res=new ArrayList<>();
if(root==null)
return res;
Queue<TreeNode> queue=new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
int levelNum=queue.size();
for(int i=0;i<levelNum;i++){
if(queue.peek().left!=null)
queue.add(queue.peek().left);
if(queue.peek().right!=null)
queue.add(queue.peek().right);
res.add(queue.poll().val);
}
}
return res;
}
}