-
Notifications
You must be signed in to change notification settings - Fork 0
/
naryTreeLevelOrderTraversal.js
57 lines (45 loc) · 1.47 KB
/
naryTreeLevelOrderTraversal.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// https://leetcode.com/problems/n-ary-tree-level-order-traversal/
// 429. N-ary Tree Level Order Traversal
// Medium
// 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]
/**
* // Definition for a Node.
* function Node(val,children) {
* this.val = val;
* this.children = children;
* };
*/
/**
* @param {Node} root
* @return {number[][]}
*/
var levelOrder = function(root) {
if(!root) return []
const res = [[root.val]]
const queue = [];
queue.push(root)
while (queue.length > 0 ){
const currentArr = [];
let numOfCurElements = queue.length
while (numOfCurElements > 0 ){
const node = queue.shift()
for (let i = 0; i < node.children.length; i++) {
queue.push(node.children[i])
currentArr.push(node.children[i].val);
}
numOfCurElements--
}
if (currentArr.length) {res.push(currentArr)}
}
return res;
};