LeetCode589 N叉树的前序遍历

题目

给定一个 N 叉树，返回其节点值的前序遍历。

示例

例如，给定一个 3叉树 :

返回其前序遍历: [1,3,5,6,2,4]。

说明: 递归法很简单，你可以使用迭代法完成此题吗?

C++代码

1. 递归

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    vector<int> preorder(Node* root) 
    {
        vector<int> pre_seq;
        if(root==NULL)
            return pre_seq;        
        pre_seq.push_back(root->val);
        if(root->children.size()!=0)
        {
            for(int i=0;i<root->children.size();i++)
            {
                vector<int> tmp = preorder(root->children.at(i));
                pre_seq.insert(pre_seq.end(),tmp.begin(),tmp.end());
            }
        }
        return pre_seq;
    }
};

2. 迭代法
   采用栈的思想。但是子节点是逆序入栈。

class Solution {
public:
    vector<int> preorder(Node* root) 
    {
        vector<int> pre_seq;
        if(root==NULL)
            return pre_seq;        
        stack<Node *> s_node;
        s_node.push(root);
        while(!s_node.empty())
        {
            Node *cur=s_node.top();
            s_node.pop();
            pre_seq.push_back(cur->val);
            
            if(cur->children.size()!=0)
            {
                for(vector<Node *>::reverse_iterator it=cur->children.rbegin();it!=cur->children.rend();it++)
                {
                    s_node.push(*it);
                }
            }
        }
        return pre_seq;
    }
};