题目描述
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
code:
import java.util.ArrayList;
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<TreeNode>();
ArrayList<Integer> list = new ArrayList<Integer>();
TreeNode temp = null;
queue.offer(root);
while((temp = queue.poll())!=null){
list.add(temp.val);
if(temp.left!=null){
queue.offer(temp.left);
}
if(temp.right!=null){
queue.offer(temp.right);
}
}
while(!queue.isEmpty()){
list.add(queue.poll().val);
}
return list;
}
}