LeetCode--429--medium--NaryTreeLevelorderTraversal

package com.app.main.LeetCode.tree;

import com.app.main.LeetCode.prebase.Node;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

/**
 *
 * 429
 *
 * medium
 *
 * https://leetcode.com/problems/n-ary-tree-level-order-traversal/
 *
 * Given an n-ary tree, return the level order traversal of its nodes' values.
 *
 * Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
 *
 *
 *
 * Example 1:
 *
 *
 *
 * Input: root = [1,null,3,2,4,null,5,6]
 * Output: [[1],[3,2,4],[5,6]]
 * Example 2:
 *
 *
 *
 * Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
 * Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
 *
 *
 * Constraints:
 *
 * The height of the n-ary tree is less than or equal to 1000
 * The total number of nodes is between [0, 10^4]
 *
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/12/6
 * Time:下午6:53
 */
public class NaryTreeLevelorderTraversal {

    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> result = new ArrayList<>();
        levelorderTraversal(root, result, 0);
        return result;
    }

    private void levelorderTraversal(Node curr, List<List<Integer>> result, int h) {
        if (curr != null) {
            // todo
            List<Integer> temp = new ArrayList<>();
            if (result.size() - 1 < h) {
                temp.add(curr.val);
                result.add(temp);
            } else {
                temp = result.get(h);
                temp.add(curr.val);
            }
            if (curr.children != null) {
                for (int i = 0; i < curr.children.size(); i++) {
                    levelorderTraversal(curr.children.get(i), result, h + 1);
                }
            }
        }
    }

    // BFS
    public List<List<Integer>> levelOrder2(Node root) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) {
            return result;
        }
        Queue<Node> queue = new LinkedList();
        queue.offer(root);
        while (!queue.isEmpty()) {
            List<Integer> temp = new ArrayList<>();
            int cn = queue.size();
            while (cn > 0) {
                Node node = queue.poll();
                temp.add(node.val);
                queue.addAll(node.children);
                cn--;
            }
            result.add(temp);
        }
        return result;
    }
}