BM26 求二叉树的层序遍历

解题思路：递归按层创建一个list,深度相同的放到一个list里，每个节点只遍历一次，故时间复杂度O(n)，空间复杂度O(n)

import java.util.*;

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

public class Solution {
    /**
     *
     * @param root TreeNode类
     * @return int整型ArrayList<ArrayList<>>
     */
    public ArrayList<ArrayList<Integer>> levelOrder (TreeNode root) {
        // write code here
        ArrayList<ArrayList<Integer>> list = new ArrayList<>();
        addToList(root, list, 0);
        return list;
    }

    private void addToList(TreeNode root, ArrayList<ArrayList<Integer>> list, int depth) {
        if (root == null) {
            return;
        }
        if (list.size() == depth) {
        	ArrayList<Integer> inList = new ArrayList<>();
            list.add(inList);
        }
        list.get(depth).add(root.val);
        addToList(root.left, list, depth + 1);
        addToList(root.right, list, depth + 1);
    }
}

扩展：非递归版本实现

import java.util.*;

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

public class Solution {
    /**
     *
     * @param root TreeNode类
     * @return int整型ArrayList<ArrayList<>>
     */
    public ArrayList<ArrayList<Integer>> levelOrder (TreeNode root) {
        // write code here
        ArrayList<ArrayList<Integer>> list = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            ArrayList<Integer> inList = new ArrayList<>();
            int size = queue.size();
            for (int i = 0 ; i < size; i++) {
                TreeNode node = queue.remove();
                inList.add(node.val);
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
            list.add(inList);
        }
        return list;
    }
}