Coding - N-ary Tree Level Order Traversal

Problem Statement

Given an n-ary tree, return the level order traversal of the tree's values. (ie., from left to right, level by level).

Constraints

• The height of the tree is in the range [1, 100].
• The number of nodes in each level is in the range [1, 100].
• The number of nodes in the tree is in the range [1, 10000].
• 0 <= Node.val <= 10000 for each node in the tree.

Example 1:

Input: root = [1,null,3,2,4,null,5,6] Output: [[1],[3,2,4],[5,6]] Explanation: Given n-ary tree: 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 depth of the tree is at most 1000.
• The total number of nodes is between [0, 10^4].
• Each node has at most 10^4 children.

Hints:

• You can use breadth-first search to solve this problem.

NOT_FOUND