LeetCode第429题：N叉树的层序遍历

题目详述

给定一个 N 叉树，返回其节点值的层序遍历。 (即从左到右，逐层遍历)

解法一

队列实现广度优先搜素。时间复杂度：O(n)，空间复杂度：O(n)

class Solution {
    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;
        Queue<Node> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            List<Integer> level = new ArrayList<>();
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                Node temp = queue.poll();
                level.add(temp.val);
                queue.addAll(temp.children);
            }
            result.add(level);
        } 
        return result;
    }
}

解法二

解法一的优化版。时间复杂度：O(n),空间复杂度：O(n)

class Solution {
    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;

        List<Node> previousLayer = Arrays.asList(root);
        while (!previousLayer.isEmpty()) {
            List<Node> currentLayer = new ArrayList<>();
            List<Integer> previousvals = new ArrayList<>();
            for (Node node : previousLayer) {
                previousvals.add(node.val);
                currentLayer.addAll(node.children);
            }
            result.add(previousvals);
            previousLayer = currentLayer;
        }
        return result;
    }
}

解法三

递归。时间复杂度：O(n),空间复杂度：O(logn)

class Solution {
    List<List<Integer>> result = new ArrayList<>();
    public List<List<Integer>> levelOrder(Node root) {
        if (root != null) helper(root, 0);
        return result;
    }
    public void helper(Node node, int level) {
        if (result.size() <=level) result.add(new ArrayList<>());
        result.get(level).add(node.val);
        for (Node child : node.children) helper(child, level + 1);
    }
}