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