面试题60：把二叉树打印成多行

import java.util.ArrayList;
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 {
    ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        ArrayList<ArrayList<Integer>> result =new  ArrayList<ArrayList<Integer>>();
        if(pRoot==null)
            return result;
        LinkedList<TreeNode> layer = new LinkedList<TreeNode> ();       
        ArrayList<Integer> layerList=new ArrayList<Integer> ();
        layer.add(pRoot);
        
        int start=0,end=1;
        while(!layer.isEmpty()){
            TreeNode cur=layer.remove();
            layerList.add(cur.val);
            
            if(cur.left!=null){
                start++;
                layer.add(cur.left);
            }
            if(cur.right!=null){
                start++;
                layer.add(cur.right);
            }
            
            end--;
            if(end==0){
                
                end=start;
                start=0;
                result.add(layerList);
                layerList=new ArrayList<Integer> ();
            }
        }
        return result;
    }
    
}