N叉树的层序遍历---leetcode 429题

 

思想还是二叉树层序遍历的思想，只不过在后边输入每一子层元素时的操作是用for循环代替。 

/*
// 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) {
       queue<Node*> que;
       if(root != NULL) que.push(root);
       vector<vector<int>> result;
       while(!que.empty()) {
           int size = que.size();
           vector<int> vec;
           for(int i = 0; i < size; i++) {
               Node* node = que.front();
               que.pop();
               vec.push_back(node->val);
               for(int i = 0; i < node->children.size(); i++){
                   if(node->children[i]) que.push(node->children[i]);
               }            
           }
           result.push_back(vec);
       } 
       return result;
    }
};