forked from illuz/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAC_recursion_n.cpp
More file actions
44 lines (37 loc) · 845 Bytes
/
Copy pathAC_recursion_n.cpp
File metadata and controls
44 lines (37 loc) · 845 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
/*
* Author: illuz <iilluzen[at]gmail.com>
* File: AC_recursion_n.cpp
* Create Date: 2015-01-02 14:17:50
* Descripton: recursion
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 0;
// Definition for binary tree
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
private:
void orderHelper(vector<int> &res, TreeNode *cur) {
if (!cur)
return;
res.push_back(cur->val);
if (cur->left)
orderHelper(res, cur->left);
if (cur->right)
orderHelper(res, cur->right);
}
public:
vector<int> preorderTraversal(TreeNode *root) {
vector<int> res;
orderHelper(res, root);
return res;
}
};
int main() {
return 0;
}