public class Solution {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
ArrayList<Integer> list = new ArrayList<Integer>();
if(root == null) {
return list;
}
//用一个队列即可
Queue<TreeNode> help = new LinkedList<TreeNode>();
help.add(root);
//队列不空 出队一个元素
while(!help.isEmpty()) {
TreeNode node = help.poll();
list.add(node.val);
if(node.left != null) {
help.add(node.left);
}
if(node.right != null) {
help.add(node.right);
}
}
return list;
}
}