Traversing N-ary trees

Post Order

Problem

First iteration

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/*
// 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> postorder(Node* root) {
        stack<int> s;
        vector<int> v;
        if (root == nullptr) return v;
        s.push(root);
        while(!s.empty()) {
            Node *node = s.top();
            s.pop();
            v.insert(v.begin(), node->val);
            for (Node* c: node->children) {
                s.push(c);
            }
        }
        return v;
    }
};

Recursive

Preorder

todo

Inorder

todo