leetcode589. N叉树的前序遍历

题目描述

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

例如，给定一个 3叉树 :

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

 

思路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> res;
        preorder(root, res);
        return res;
    }
    
    void preorder(Node* root, vector<int>& res){
        if (!root) return;
        res.push_back(root->val);
        int n = root->children.size();
        for (int i = 0; i < n; i++){
            preorder(root->children[i], res);
        }
    }
};

 

思路2

迭代。

 

代码

/*
// 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> res;
        if (!root) return res;
        stack<Node*> s;
        s.push(root);
        while (!s.empty()){
            Node* tmp = s.top();
            s.pop();
            res.push_back(tmp->val);
            int n = tmp->children.size();
            for (int i = n-1; i >= 0; i--)
                s.push(tmp->children[i]);
        }
        return res;
    }

};