从上到下逐层打印一棵树

public class TreePrinter {
public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
    ArrayList<Integer> list = new ArrayList<Integer>();
    if (root == null) {
        return list;
    }
    Queue<TreeNode> queue = new LinkedList<TreeNode>();
    queue.add(root);
    while (!queue.isEmpty()) {
        TreeNode treeNode = queue.poll();
        list.add(treeNode.val);
        if (treeNode.left != null) {
            queue.add(treeNode.left);
        }
        if (treeNode.right != null) {
            queue.add(treeNode.right);
        }
    }
    return list;
    }


public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;

public TreeNode(int val) {
    this.val = val;
}

}

测试：

public static void main(String[] args) {
    TreePrinter treePrinter = new TreePrinter();
    TreeNode target1 = new TreeNode(1);
    TreeNode t