广搜遍历二叉树

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

import java.util.*;
/**
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<Integer>();
        if(root == null ) return list;
        LinkedList<TreeNode> nodeList = new LinkedList<TreeNode>();
        nodeList.add(root);

        while (!nodeList.isEmpty()){
            TreeNode node = nodeList.pop();
            if(node.left != null) nodeList.add(node.left);
            if (node.right != null) nodeList.add(node.right);
            list.add(node.val);
        }

        return list;
    }
}