剑指offer 从上往下打印二叉树

题目描述：
从上往下打印出二叉树的每个节点，同层节点从左至右打印。

思路：使用一个ArrayList模拟队列，把根节点加进去，然后每次输出ArrayList的第一个元素，并把该节点的子节点加到ArrayList中。然后从ArrayList移除这个元素。

参考代码：

import java.util.ArrayList;

public class PrintTreeFromTopToBottomA {
    ArrayList<Integer> alist = new ArrayList<>();
    ArrayList<TreeNode> nodelist = new ArrayList<>();

    public ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
        if (root != null) {
            nodelist.add(root);
            alist.add(root.val);
        } else {
            return alist;
        }

        while (!nodelist.isEmpty()) {
            root = nodelist.get(0);
            nodelist.remove(root);
            if (root.left != null) {
                nodelist.add(root.left);
                alist.add(root.left.val);
            }
            if (root.right != null) {
                nodelist.add(root.right);
                alist.add(root.right.val);
            }

        }
        return alist;
    }

    //主函数
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(0);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(6);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(7);
        TreeNode node7 = new TreeNode(8);
        TreeNode node8 = new TreeNode(9);
        TreeNode node9 = new TreeNode(3);
        TreeNode node0 = new TreeNode(1);

        node1.left = node2;
        node1.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = null;
        node3.right = node6;
        node4.left = node7;
        node4.right = null;
        node5.left = node8;
        node5.right = node9;
        node6.left = null;
        node6.right = null;
        node7.right = node0;

        PrintTreeFromTopToBottomA p = new PrintTreeFromTopToBottomA();
        ArrayList<Integer> arrayList = p.PrintFromTopToBottom(null);
        for (Integer integer : arrayList) {

            System.out.print(String.valueOf(integer) + "  ");
        }
    }
}

TreeNode：

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

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

    public void printTreeNode(TreeNode node) {
        System.out.print(node.val + " ");
        if (node.left != null) {
            printTreeNode(node.left);
        }
        if (node.right != null) {
            printTreeNode(node.right);
        }
    }

}