#include "leetcode.h" class Solution { public: vvd(int) levelOrder(Node *root) { vvd(int) ans; if (!root) return ans; queue q; q.push(root); while (!q.empty()) { int n = q.size(); vector v; while (n--) { auto curr = q.front(); q.pop(); v.push_back(curr->val); for (auto it : curr->children) q.push(it); } ans.push_back(v); } return ans; } };