题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
考察队列的使用
Queue queue =new LinkedList<>();
树的初始化:
public class TreeNode(){
int val;
TreeNode left=null;
TreeNode right=null;
public TreeNode(int val){
this.val=val;
}
}
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
Queue<TreeNode> queue=new LinkedList<>();
ArrayList<Integer> list=new ArrayList<Integer>();
if(root==null)return list;
queue.add(root);
while(!queue.isEmpty()){
TreeNode tmp=queue.peek();
if(tmp.left!=null){
queue.add(tmp.left);
}
if(tmp.right!=null){
queue.add(tmp.right);
}
list.add(tmp.val);
queue.poll();
}
return list;
}
}