import java.util.ArrayList;
/**
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> list=new ArrayList<>();
ArrayList<TreeNode>queue=new ArrayList<>();
if(root==null)
return list;
queue.add(root);
while(!queue.isEmpty())
{
TreeNode node= queue.remove(0);
if(node.left!=null)
queue.add(node.left);
if(node.right!=null)
{
queue.add(node.right);
}
list.add(node.val);
}
return list;
}
}