429. N-ary Tree Level Order Traversal

Given an n-ary tree, return the level order traversal of its nodes’ values.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

c++

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val) {
        val = _val;
    }

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        if(!root) return {};
        vector<vector<int>> res;
        queue<Node*> q;
        q.push(root);
        
        while(!q.empty()) {
            vector<int> cur;
            int sz = q.size();
            while(sz--) {
                auto n = q.front();
                q.pop();
                cur.push_back(n->val);
                for(auto& c : n->children) {
                    q.push(c);
                }
            }
            res.push_back(cur);
        }
        
        return res;
    }
};