-
Notifications
You must be signed in to change notification settings - Fork 0
/
inorderTraverse.cc
64 lines (56 loc) · 1.54 KB
/
inorderTraverse.cc
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
54
55
56
57
58
59
60
61
62
63
64
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode *root) {
if (!root) return vector<int>();
vector<int> ret;
stack<TreeNode *> s;
s.push(root);
TreeNode *cur = root->left;
while (cur) {
s.push(cur);
cur = cur->left;
}
while (s.size()) {
TreeNode *cur = s.top();
ret.push_back(cur->val);
s.pop();
if (cur->right) {
s.push(cur->right);
cur = cur->right;
cur = cur->left;
while (cur) {
s.push(cur);
cur = cur->left;
}
}
}
return ret;
}
//-----------------------------//
vector<int> inorderTraversal(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> res;
if (!root) {
return res;
}
if (root->left) {
res = inorderTraversal(root->left);
}
res.push_back(root->val);
if (root->right) {
vector<int> tmp = inorderTraversal(root->right);
res.insert( res.end(), tmp.begin(), tmp.end() );
}
return res;
}
};