-
Notifications
You must be signed in to change notification settings - Fork 0
/
Inorder_traversal
40 lines (38 loc) · 882 Bytes
/
Inorder_traversal
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
/**
* Definition for a binary tree node.
* 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> result;
if(root==NULL)
return result;
vector<TreeNode*> stack;
unordered_map <TreeNode*,int> dict;
stack.push_back(root);
dict[root] = 1;
auto node = root;
while (stack.size() > 0) {
node = stack.at(stack.size() - 1);
while (node->left != NULL && dict[node->left]!=1) {
node = node->left;
stack.push_back(node);
dict[node] = 1;
}
result.push_back(node->val);
stack.pop_back();
if (node->right != NULL && dict[node->right]!=1) {
node = node->right;
stack.push_back(node);
dict[node] = 1;
}
}
return result;
}
};