从上往下打印出二叉树的每个节点,同层节点从左至右打印。
思路:
从上往下,从左到右,即层次遍历,可通过队列实现。
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> aList = new ArrayList<Integer>();
if(null == root){
return aList;
}else{
Queue<TreeNode> queue = new LinkedList<TreeNode>();
TreeNode node = null;
queue.add(root);
while(!queue.isEmpty()){
node = (TreeNode)queue.peek();
queue.poll();
aList.add(node.val);
if(node.left != null){
queue.offer(node.left);
}
if(node.right != null){
queue.offer(node.right);
}
}
return aList;
}
}
}