Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid April, 2025
Meta
Senior
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.