Leetcode589. N-ary Tree Preorder Traversal (C++)

最新推荐文章于 2024-09-16 06:54:08 发布

Tscharrl

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量200

点赞数

分类专栏： Leetcode 文章标签： leetcode 树结构 dfs c++

本文链接：https://blog.csdn.net/SherryTuan/article/details/106036301

版权

Leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Leetcode589. N-ary Tree Preorder Traversal

递归与非递归（DFS）：

/*
// 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<int> preorder(Node* root) {
        /*
         * Recursion
         * Runtime: 40 ms, 82.67%
         * Memory Usage: 11.3 MB, 100.00%
         */
        preorder_recur(root);
        return pre;
    }

    vector<int> preorder_iter(Node* root) {
        /*
        * Iteration
        * Runtime: 36 ms, 94.91%
        * Memory Usage: 11.3 MB, 100.00%
        */
        vector<int> v;
        if (root == NULL) return v;
        stack<Node*> s;
        s.push(root);
        while (!s.empty()) {
            Node* n = s.top(); s.pop();
            if (n != NULL)
                v.push_back(n->val);
            for(auto it = n->children.crbegin(); it != n->children.crend(); ++it)
                s.push(*it);
        }
        return v;
    }

private:
    vector<int> pre;
    void preorder_recur(Node* root) {
        if (root == NULL) return;
        pre.push_back(root->val);
        for (auto child : root->children)
            preorder_recur(child);
    }
};