Leetcode 429. N-ary Tree Level Order Traversal

Return the node values of an n-ary tree grouped by depth (level-order / breadth-first traversal), producing a list of lists where each inner list contains the values at that level. Input size can be up to 10^4 nodes with height ≤1000, so an iterative BFS using a queue is typical.