lc429.N叉树的层序遍历

/**
 * // Definition for a Node.
 * function Node(val,children) {
 *    this.val = val;
 *    this.children = children;
 * };
 */

/**
 * @param {Node|null} root
 * @return {number[][]}
 */
var levelOrder = function(root) {
    if (root == null) { return [] }
    let queue = [], res = [], level = 0
    queue.push(root)
    while (queue.length) {
        let sz = queue.length
        res[level] = []
        for (let i = 0; i < sz; ++i) {
            let curr = queue.shift()
            res[level].push(curr.val)
            queue.push(...curr.children)
        }
        ++level
    }
    return res
};