forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution145.cpp
More file actions
53 lines (44 loc) · 878 Bytes
/
solution145.cpp
File metadata and controls
53 lines (44 loc) · 878 Bytes
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/**
* Binary Tree Postorder Traversal
*
* cpselvis ([email protected])
* August 28th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
vector<int> postorderTraversal(TreeNode* root) {
vector<int> ret;
dfs(ret, root);
return ret;
}
void dfs(vector<int> &ret, TreeNode *root)
{
if (root != NULL)
{
dfs(ret, root -> left);
dfs(ret, root -> right);
ret.push_back(root -> val);
}
}
};
int main(int argc, char **argv)
{
TreeNode *root = new TreeNode(1);
root -> right = new TreeNode(2);
root -> right -> left = new TreeNode(3);
Solution s;
vector<int> ret = s.postorderTraversal(root);
for (auto i : ret)
{
cout << i << endl;
}
}