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

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

题目描述

思路：

考察BFS

import java.util.ArrayList;

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;
        }        
        ArrayList<TreeNode> list = new ArrayList();
        list.add(pRoot);        
        ArrayList<Integer> r;
        while(!list.isEmpty()) {
            int size = list.size();
            r = new ArrayList();            
            for(int i = 0; i < size; i++) {
                TreeNode node = list.get(0);
                r.add(node.val);               
                if(node.left != null) {
                    list.add(node.left);
                }                
                if(node.right != null) {
                    list.add(node.right);
                }                
                list.remove(node);
            }
            result.add(r);
        }        
        return result;
    }

}