-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryTreeInorderTraversal.cpp
More file actions
55 lines (49 loc) · 1.12 KB
/
BinaryTreeInorderTraversal.cpp
File metadata and controls
55 lines (49 loc) · 1.12 KB
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
/**
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
*/
/**
* 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) {
vector<int> res;
if (!root) return res;
stack<TreeNode*> S;
TreeNode* curr = root;
bool done = false;
while (!done) {
if (curr) {
S.push(curr);
curr = curr->left;
}
else {
if (!S.empty()) {
TreeNode* top = S.top();
res.push_back(top->val);
S.pop();
curr = top->right;
}
else {
done = true;
}
}
}
return res;
}
};