> For the complete documentation index, see [llms.txt](https://emmaguo100.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://emmaguo100.gitbook.io/leetcode/04-05-2022-429.-n-ary-tree-level-order-traversal.md).

# 04/05/2022 429. N-ary Tree Level Order Traversal

429\. N-ary Tree Level Order Traversal

```
// Some code
class Solution {
    public List<List<Integer>> levelOrder(Node root) {
       List<List<Integer>> result = new LinkedList<>();
       if (root == null) return result;
        
        Queue<Node> queue = new LinkedList<>();
        queue.offer(root);
        
        while (!queue.isEmpty()){
            List<Integer> level = new LinkedList<>();
            int size = queue.size();
            for (int i = 0; i < size; i++){
                Node curr = queue.poll();
                level.add(curr.val);
                queue.addAll(curr.children);
            }
            result.add(level);
        }
        return result;
    }
}
```