Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 429. N-ary Tree Level Order Traversal
Reported Apr 10, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source