从上往下打印二叉树

利用队列，实现树的层次遍历。

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) {
        Queue<TreeNode>queue=new LinkedList<TreeNode>();
        ArrayList<Integer> result = new ArrayList<Integer>();
        if(root == null)return result;
        queue.offer(root);
        while(!queue.isEmpty()){
            TreeNode tree=queue.poll();
            result.add(tree.val);
            if(tree.left!=null)
            queue.offer(tree.left);
            if(tree.right!=null)
            queue.offer(tree.right);
        }
        return result;
        
    }
}