题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路
典型的用队列实现层序遍历
import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;
/**
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) {
ArrayList<Integer> list=new ArrayList<>();
Queue<TreeNode> q=new LinkedList<>();
q.offer(root);
while(!q.isEmpty()){
TreeNode t=q.poll();
if(t!=null){
list.add(t.val);
q.offer(t.left);
q.offer(t.right);
}
}
return list;
}
}