【刷leetcode，拿Offer-024】589. N-ary Tree Preorder Traversal

题目链接：https://leetcode.com/problems/n-ary-tree-preorder-traversal/

题面：

589. N-ary Tree Preorder Traversal

Easy

23135FavoriteShare

Given an n-ary tree, return the preorder traversal of its nodes' values.

For example, given a 3-ary tree:

 

 

Return its preorder traversal as: [1,3,5,6,2,4].

 

Note:

Recursive solution is trivial, could you do it iteratively?

题意：

先序遍历N叉树。

解题：

1.递归最简单；

2.不递归，用栈实现即可，先进后出。

代码：

class Solution {
public:
    vector<int> preorder(Node* root) {
        vector <int> res;
        vector <int> temp;
        if(root==NULL)return res;
        res.push_back(root->val);
        for(int i=0;i<root->children.size();i++){
            temp=preorder(root->children[i]);
            for(int j=0;j<temp.size();j++)
                res.push_back(temp[j]);
        }
        return res;    
    }
};