N-ary Tree Level Order Traversal LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<vector<int>> ans;
4

5
  vector<vector<int>> levelOrder(Node *root) {
6
    dfs(root, 0);
7
    return ans;
8
  }
9

10
  void dfs(Node *root, int level) {
11
    if (!root) {
12
      return;
13
    }
14
    if (level == ans.size()) {
15
      ans.push_back({});
16
    }
17
    ans[level].push_back(root->val);
18
    for (auto i : root->children) {
19
      dfs(i, level + 1);
20
    }
21
  }
22
};