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).
Example 1:
Input: root = [1,null,3,2,4,null,5,6]
Output: [[1],[3,2,4],[5,6]]
Example 2:
Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
Constraints:
- The height of the n-ary tree is less than or equal to
1000
- The total number of nodes is between
[0, 10^4]
题意
层序遍历 N 叉树,每一层存储在一个向量中
思路1
- 这一层的所有节点数为当前队列中元素个数,循环
size
次即可
代码1
/*
// 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 == NULL)
return vector<vector<int>>();
vector<vector<int>> ans;
queue<Node*> q;
q.push(root);
while(!q.empty())
{
int size = q.size();
vector<int> cur_level;
for(int i = 0; i < size; i++)
{
Node *now = q.front();
q.pop();
cur_level.push_back(now->val);
for(const auto &item : now->children)
q.push(item);
}
ans.push_back(cur_level);
}
return ans;
}
};