题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
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) {
ArrayList<Integer> arr=new ArrayList<Integer>();
if(root==null) return arr;//空树返回空的ArrayList
Queue<TreeNode> q=new LinkedList<TreeNode>();
q.offer(root);
while(!q.isEmpty()){
TreeNode p=q.poll();
arr.add(p.val);
if(p.left!=null) q.offer(p.left);
if(p.right!=null) q.offer(p.right);
}
return arr;
}
}