-
Notifications
You must be signed in to change notification settings - Fork 14
/
binary-tree-inorder-traversal.cpp
52 lines (46 loc) · 1.05 KB
/
binary-tree-inorder-traversal.cpp
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
// Given a binary tree, return the inorder traversal of its nodes' values.
//
// Example:
//
//
// Input: [1,null,2,3]
// 1
// \
// 2
// /
// 3
//
// Output: [1,3,2]
//
// Follow up: Recursive solution is trivial, could you do it iteratively?
//
/**
* 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 = {};
stack<TreeNode*> stackTree;
TreeNode* node = root;
while ((!stackTree.empty())||(node != NULL)) {
if (node != NULL) {
stackTree.push(node);
node = node->left;
}
else {
node = stackTree.top();
stackTree.pop();
result.push_back(node->val);
node = node->right;
}
}
return result;
}
};