-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbst.cpp
More file actions
207 lines (182 loc) · 4.65 KB
/
bst.cpp
File metadata and controls
207 lines (182 loc) · 4.65 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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
/*
* bsl.cpp
* Copyright (C) 2017 zhangyuehua <[email protected]>
*
* Distributed under terms of the MIT license.
* complie: g++ -std=c++11 bst.cpp -g -o bst
*/
#include <vector>
#include <iostream>
#include <stdlib.h>
using namespace std;
struct tree_node {
int data;
tree_node* left;
tree_node* right;
tree_node* parent;
};
class Bst {
private:
tree_node root;
int size;
public:
Bst() {
root.data = 0;
root.parent = NULL;
root.left = NULL;
root.right = NULL;
size = 1;
}
Bst(int i) {
root.data = i;
root.parent = NULL;
root.left = NULL;
root.right = NULL;
size = 1;
}
~Bst() {
}
tree_node* create_node(int i);
void mid_traverse(const tree_node* root);
void pre_traverse(const tree_node* root);
void add_node(tree_node* node);
tree_node* get_root();
tree_node* search(int i);
void del_node(int i);
};
tree_node* Bst::create_node(int i) {
tree_node* t = (tree_node*)malloc(sizeof(tree_node));
t->data = i;
t->left = NULL;
t->right = NULL;
t->parent = NULL;
return t;
}
void Bst::mid_traverse(const tree_node* root) {
if (root == NULL) {
cout<< endl;
return;
}
if (root->left != NULL) {
mid_traverse(root->left);
}
cout << root->data << "\t";
if (root->right != NULL) {
mid_traverse(root->right);
}
}
void Bst::pre_traverse(const tree_node* root) {
if (root == NULL) {
cout << endl;
return;
}
cout << root->data << "\t";
if (root->left != NULL) {
pre_traverse(root->left);
}
if (root->right != NULL) {
pre_traverse(root->right);
}
}
void Bst::add_node(tree_node* node) {
tree_node* p = &root;
while(1) {
if (node->data < p->data) {
if ( p->left == NULL ) {
p->left = node;
node->parent = p;
return;
}
p = p->left;
} else if (node->data > p->data) {
if (p->right == NULL) {
p->right = node;
node->parent = p;
return;
}
p = p->right;
} else if (node->data == p->data) {
break;
}
}
}
tree_node* Bst::get_root() {
return &root;
}
tree_node* Bst::search(int i) {
tree_node* p = &root;
while(1) {
if (p == NULL) {
return p;
} else if (i == p->data) {
return p;
} else if (i > p->data) {
p = p->right;
} else if (i < p->data) {
p = p->left;
}
}
}
void Bst::del_node(int i) {
tree_node* p = search(i);
if (p == NULL) {
return; // not found do nothing
} else {
// p has no child
if (p->left == NULL && p->right == NULL) {
tree_node* parent = p->parent;
if (parent->left == p) {
parent->left = NULL;
} else if (parent->right == p) {
parent->right = NULL;
}
delete p;
} else if (p->left == NULL && p->right != NULL) {
// p has one right child
tree_node* parent = p->parent;
if (parent->left == p) {
parent->left = p->right;
} else if (parent->right == p) {
parent->right = p->right;
}
delete p;
} else if (p->right == NULL && p->left != NULL) {
// p has one left child
tree_node* parent = p->parent;
if (parent->left == p) {
parent->left = p->left;
} else if (parent->right == p) {
parent->right = p->left;
}
delete p;
}
}
}
int main(int argc, char* argv[]) {
for (int i = 0 ; i< argc; ++i) {
// arg 0 is the app itself
std::cout<<"arg[" << i << "]" << argv[i] << std::endl;
}
/*
* add your code here
*/
Bst bst(45);
tree_node* n;
vector<int> a = {24,53,12,37,93,22,27,18,58,74};
for (size_t i = 0; i< a.size(); ++i) {
n = bst.create_node(a[i]);
bst.add_node(n);
}
cout << "pre: " << endl;
bst.pre_traverse(bst.get_root());
cout << "mid: " << endl;
bst.mid_traverse(bst.get_root());
for (int i = 21; i< 28; ++i) {
if (bst.search(i)) {
cout << "find " << i << " in bst" << endl;
} else {
cout << "not found " << i << " in bst" << endl;
}
}
return 0;
}