题目链接:https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/
题目如下:
/*
// 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>> result;
if(root==NULL) return result;
queue<Node*> que;
que.push(root);
while(!que.empty()){
int size=que.size();
vector<int> temp;
while(size--){
Node* node=que.front();
que.pop();
temp.push_back(node->val);
for(int i=0;i<node->children.size();i++){
Node* tmp=node->children[i];
if(tmp) que.push(tmp);
}
}
result.push_back(temp);
}
return result;
}
};