forked from tscott8/cs235
-
Notifications
You must be signed in to change notification settings - Fork 0
/
cs235_assign14.cpp
344 lines (309 loc) · 9.9 KB
/
cs235_assign14.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
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
/******************************************************************************
* Program:
* Assignment 14, Binary Search Tree
* Brother Ercanbrack, CS 235
* Author:
* Tyler Scott
* Summary:
* This program defines the member functions for the BTree search class
*
* Estimated time: 8.0hrs
* Actual time: 4.0hrs
******************************************************************************/
#include <iostream>
using namespace std;
/*****************************************************************************
* BTree Class
*****************************************************************************/
class BTree
{
private:
int data; // --- data stored in node of tree
BTree* left; // --- pointer to left subtree
BTree* right; // --- pointer to right subtree
BTree* parent; // --- pointer to the parent node
public:
BTree(int data = 0);
~BTree(void);
void insertLeft(int item); // creates a new node and inserts node to left
void insertRight(int item); // creates a new node and inserts node to right
BTree* getLeftChild(void); // return the ptr to the left child
BTree* getRightChild(void); // return the ptr to the right child
BTree* getParent(void); // return parent
int getData(void);
void setData(int item);
void setLeft(BTree* tree);
void setRight(BTree* tree);
void infix(void); // do infix traversal
void prefix(void); // do prefix traversal
void postfix(void); // do postfix traversal
void level(void); // do level order traversal
};
/*****************************************************************************
* BST Class
*****************************************************************************/
class BST
{
private:
BTree* root;
public:
BST();
int empty(void);
BTree* search(int item);
void insert(int item);
void remove(int item);
void BSTInfix(void);
};
/*****************************************************************************
* Default BTree constructor
*****************************************************************************/
BTree :: BTree(int data)
{
this->data = data;
left = NULL;
right = NULL;
parent = NULL;
}
/*****************************************************************************
* Deconstructor left blank because it is not used
*****************************************************************************/
BTree :: ~BTree(void)
{
}
/*****************************************************************************
* Inserts a node on the left pointer of the current node
*****************************************************************************/
void BTree :: insertLeft(int item)
{
BTree* insert = new BTree(item);
left = insert;
insert->parent = this;
}
/*****************************************************************************
* Inserts a node on the right pointer of the current node
*****************************************************************************/
void BTree :: insertRight(int item)
{
BTree* insert = new BTree(item);
right = insert;
insert->parent = this;
}
/*****************************************************************************
* grants access to the private BTree node "left"
*****************************************************************************/
BTree* BTree :: getLeftChild(void)
{
return left;
}
/*****************************************************************************
* grants access to the private BTree node "right"
*****************************************************************************/
BTree* BTree :: getRightChild(void)
{
return right;
}
/*****************************************************************************
* grants access to "parent"
*****************************************************************************/
BTree* BTree :: getParent(void)
{
return parent;
}
/*****************************************************************************
* grants access to "data"
*****************************************************************************/
int BTree :: getData(void)
{
return data;
}
/*****************************************************************************
* sets the value of data to what is passed in
*****************************************************************************/
void BTree :: setData(int item)
{
data = item;
}
/*****************************************************************************
* sets left to the tree that is passed in
*****************************************************************************/
void BTree :: setLeft(BTree* tree)
{
left = tree;
if (tree != NULL)
left->parent = this;
}
/*****************************************************************************
* sets the right to the tree that is passed in
*****************************************************************************/
void BTree :: setRight(BTree* tree)
{
right = tree;
if (tree != NULL)
right->parent = this;
}
/*****************************************************************************
* left visit right traversal
*****************************************************************************/
void BTree :: infix(void)
{
if (left != NULL) left->infix();
cout << data << " ";
if (right != NULL) right->infix();
}
/*****************************************************************************
* visit left right traversal
*****************************************************************************/
void BTree :: prefix(void)
{
cout << data << " ";
if (left != NULL) left->prefix();
if (right != NULL) right->prefix();
}
/*****************************************************************************
* left right visit traversal
*****************************************************************************/
void BTree :: postfix(void)
{
if (left != NULL) left->postfix();
if (right != NULL) right->postfix();
cout << data << " ";
}
/*****************************************************************************
* level order traversal.
*****************************************************************************/
void BTree :: level(void)
{
const int MAX = 50;
BTree *queue[MAX];
BTree *temp;
int front = 0;
int back = 0;
queue[back++] = this;
while (front != back)
{
temp = queue[front];
front = (front + 1) % MAX;
if (temp != NULL)
{
// visit
cout.width(4);
cout << temp->data << " ";
if (temp->parent == NULL)
cout << " Parent = NULL! " << endl;
else
cout << " Parent = " << temp->parent->data << " " << endl;
// end Visit
queue[back] = temp->left;
back = (back + 1) % MAX;
queue[back] = temp->right;
back = (back + 1) % MAX;
}
}
}
/*****************************************************************************
* Default BST constructor
*****************************************************************************/
BST::BST()
{
root = NULL;
}
/*****************************************************************************
* Checks if the tree is empty
*****************************************************************************/
int BST::empty(void)
{
if (root == NULL)
return 0;
else
return 1;
}
/*****************************************************************************
* Search the Tree for the item
*****************************************************************************/
BTree* BST::search(int item)
{
BTree* z = root; // create a new temp tree
bool found = false;
while (!found && z != 0) // loop while its not found
{
if (item < z->getData()) // if its less go left
z = z->getLeftChild();
else if (item > z->getData()) // if its greater go right
z = z->getRightChild();
else
found = true; // you found it!
}
return z;
}
/*****************************************************************************
* Inserts into the tree and sorts to the correct spots
*****************************************************************************/
void BST::insert(int item)
{
BTree* z = root; // temporary tree
BTree* parent = NULL;
bool found = false;
//search to check where to insert
while (!found && z != 0)
{
parent = z;
if (item <= z->getData())
z = z->getLeftChild();
else if (item >= z->getData())
z = z->getRightChild();
else
found = true;
}
// if inserting
if (z == 0)
{
z = new BTree(item); // set up a new tree
if (parent == 0)
root = z;
else if (item <= parent->getData())
{
parent->setLeft(z); // insert right of parent
}
else if (item >= parent->getData())
{
parent->setRight(z); // insert left of parent
}
}
}
/*****************************************************************************
* Removes from the tree from the correct spot
*****************************************************************************/
void BST::remove(int item)
{
BTree* z = search(item); // z is a temporary tree
if (z == NULL)
{
cout << "Item " << item << " is not found, cannot delete it!\n";
return;
}
if (z->getLeftChild() != 0 && z->getRightChild() != 0)
{
BTree* zSucc = z->getRightChild();
while (zSucc->getLeftChild() != 0)
zSucc = zSucc->getLeftChild();
z->setData(zSucc->getData());
z = zSucc;
}
BTree* subTree = z->getLeftChild();
if (subTree == 0)
subTree = z->getRightChild();
if (z == 0)
root = subTree;
else if (z->getParent()->getLeftChild() == z)
z->getParent()->setLeft(subTree);
else
z->getParent()->setRight(subTree);
delete z;
}
/*****************************************************************************
* Infix BST traversal
*****************************************************************************/
void BST::BSTInfix(void)
{
if (root != NULL) root->infix(); // call the BTREE infix
}