-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
94.cpp
73 lines (68 loc) · 1.82 KB
/
94.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
__________________________________________________________________________________________________
4ms
/**
* 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) {
std::vector<int> ret{};
inorderTraversal(root, ret);
return ret;
}
void inorderTraversal(TreeNode *root, std::vector<int> &t){
if(root == NULL){
return ;
} else {
inorderTraversal(root->left, t);
t.push_back(root->val);
inorderTraversal(root->right, t);
return;
}
}
};
__________________________________________________________________________________________________
8456 kb
/**
* 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> out;
TreeNode* curr=root;
TreeNode *pre,*temp;
while(curr!=NULL)
{
if(curr->left==NULL)
{
out.push_back(curr->val);
curr=curr->right;
}
else
{
pre = curr->left;
while(pre->right!=NULL)
pre = pre -> right;
pre -> right = curr;
temp = curr;
curr = curr->left;
temp->left=NULL;
}
}
return out;
}
};
__________________________________________________________________________________________________