【LeetCode】589. N-ary Tree Preorder Traversal

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

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?

解法1(递归):

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

解法2（迭代）：
用栈实现

class Solution {
public:
    vector<int> ans;
    vector<int> preorder(Node* root) {
        stack<Node*> stk;
        if(!root)return ans;
        stk.push(root);
        while(!stk.empty()){
            Node* nod=stk.top();
            stk.pop();
            int len=nod->children.size();
            for(int i=len-1;i>=0;i--){
                stk.push(nod->children[i]);
            }
            ans.push_back(nod->val);
        }
        return ans;  
    }
};