LeetCode/145.cpp at main · rkibel/LeetCode · GitHub

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
#include <vector>
using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Problem145 {
public:
    vector<int> res;
    vector<int> postorderTraversal(TreeNode* root) {
        if (!root) return res;
        traverse(root);
        return res;
    }
    void traverse(TreeNode* root){
        if (root->left) traverse(root->left);
        if (root->right) traverse(root->right);
        res.push_back(root->val);
    }
};