NAry level order traversal.cpp

/*
// 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) {

    

    vector<vector<int>> ans;

    if(!root) return ans;

    

    queue<Node*>q;

    q.push(root);

    

    while(!q.empty()){

        

        int sz=q.size();

        vector<int> v;

        

        while(sz--){

            auto curr=q.front();

            q.pop();       

            v.push_back(curr->val);

  

            for(auto it:curr->children){    //pushing curr node's children in queue

                q.push(it);

            }

        }

        ans.push_back(v);

    }

    return ans;

}

};