-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchTree.cpp
499 lines (436 loc) · 11.8 KB
/
BinarySearchTree.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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
#include<stdio.h>
#include<stdlib.h>
#include<limits.h>
#define FALSE_VALUE 0
#define TRUE_VALUE 1
struct treeNode
{
int item;
struct treeNode * left; //points to left child
struct treeNode * right; //points to right child
};
struct treeNode * root;
void initializeTree()
{
root = 0;
}
struct treeNode * searchItem(struct treeNode * node, int item)
{
if(node==0) return 0;
if(node->item==item) return node; //found, return node
struct treeNode * t = 0;
if(item < node->item)
t = searchItem(node->left, item); //search in the left sub-tree
else
t = searchItem(node->right, item); //search in the right sub-tree
return t;
};
struct treeNode * makeTreeNode(int item)
{
struct treeNode * node ;
node = (struct treeNode *)malloc(sizeof(struct treeNode));
node->item = item;
node->left = 0;
node->right = 0;
return node;
};
struct treeNode * insertItem(struct treeNode * node, int item)
{
if(node==0) //insert as the root as the tree is empty
{
struct treeNode * newNode = makeTreeNode(item);
root = newNode;
return newNode;
}
if(node->item==item) return 0; //already an item exists, so return NULL
if(item<node->item && node->left==0) //insert as the left child
{
struct treeNode * newNode = makeTreeNode(item);
node->left = newNode;
return newNode;
}
if(item>node->item && node->right==0) //insert as the right child
{
struct treeNode * newNode = makeTreeNode(item);
node->right = newNode;
return newNode;
}
if(item<node->item)
return insertItem(node->left, item); //insert at left sub-tree
else
return insertItem(node->right, item); //insert at right sub-tree
}
int calcNodeHeight(struct treeNode * node) //return height of a node
{
if(node==0) return -1;
int l, r;
l = calcNodeHeight(node->left);
r = calcNodeHeight(node->right);
if(l>r) return l+1;
else return r+1;
}
int calcHeight(int item) //return height of an item in the tree
{
struct treeNode * node = 0;
node = searchItem(root, item);
if(node==0) return -1; //not found
else return calcNodeHeight(node);
}
int getSize(struct treeNode * node)
{
if(node==0)
{
return 0;
}
return getSize(node->left)+getSize(node->right)+1;
}
int calcNodeDepth(struct treeNode * node) //return depth of a node
{
//write your codes here
struct treeNode *temp;
temp=root;
int i;
if(root==0)
{
return FALSE_VALUE;
}
for(i=0;(temp!=0)&&(temp->item!=node->item);i++)
{
if(temp->item>node->item)
{
temp=temp->left;
}
else if(temp->item<node->item)
{
temp=temp->right;
}
}
return i;
}
int calcDepth(int item)//return depth of an item in the tree
{
//write your codes here
struct treeNode * node = 0;
node = searchItem(root, item);
return calcNodeDepth(node);
}
int deleteItem(struct treeNode * node, int item)
{
//write your code here, return TRUE, FALSE
if(node!=0)
{
struct treeNode *target=searchItem(node,item);
if(node==target)
{
if((target->left==0)&&(target->right==0))// no children
{
free(target);
root=0;
return TRUE_VALUE;
}
else if(target->left==0)//right
{
root=target->right;
free(target);
return TRUE_VALUE;
}
else if(target->right==0)//left
{
root=target->left;
free(target);
return TRUE_VALUE;
}
else// left right both
{
struct treeNode *prev,*temp,*prev1;
temp=target->right;
for(;temp!=0;)//replacer
{
prev=temp;
temp=temp->left;
}
if(prev==target->right)// if replacer is the immediate right of target
{
target->item=prev->item;
target->right=prev->right;// target is following replacer s child
free(target->right);
return TRUE_VALUE;
}
temp=target->right;
for(;temp!=prev;)// parent of replacer
{
prev1=temp;
temp=temp->left;
}
target->item=prev->item;// replacing
prev1->left=prev->right;// parent of replacer is following replacer s child
//free(target);//freeing
//prev1->left=0;
return TRUE_VALUE;
}
}
else//not root node
{
struct treeNode *temp=root,*prev=0;
for(;(temp!=0)&&(temp->item!=item);)//searching parent of target
{
prev=temp;
if(temp->item>item)
{
temp=temp->left;
}
else if(temp->item<item)
{
temp=temp->right;
}
}
if((target->left==0)&&(target->right==0))// no children
{
//free(target);
//root=0;
if(prev->left==target)
{
free(prev->left);
prev->left=0;
}
else if(prev->right==target)
{
free(target);
prev->right=0;
}
return TRUE_VALUE;
}
else if(target->left==0)//right
{
/*target=target->right->item;
free(target->right);
target->right=0;
return TRUE_VALUE;*/
if(prev->left==target)
{
prev->left=target->right;
free((target));
return TRUE_VALUE;
}
else if(prev->right==target)
{
prev->right=target->right;
free((target));
return TRUE_VALUE;
}
}
else if(target->right==0)//left
{
if(prev->left==target)
{
prev->left=target->left;
free((target));
return TRUE_VALUE;
}
else if(prev->right==target)
{
prev->right=target->left;
free((target));
return TRUE_VALUE;
}
}
else// left right both
{
struct treeNode *prev,*temp,*prev1;
temp=target->right;
for(;temp!=0;)//replacer
{
prev=temp;
temp=temp->left;
}
if(prev==target->right)// if replacer is the immediate right of target
{
target->item=prev->item;
target->right=prev->right;// target is following replacer s child
free(prev);
return TRUE_VALUE;
}
temp=target->right;
for(;temp!=prev;)// parent of replacer
{
prev1=temp;
temp=temp->left;
}
target->item=prev->item;// replacing
prev1->left=prev->right;// parent of replacer is following replacer s child
//free(target);//freeing
//prev1->left=0;
return TRUE_VALUE;
}
}
}
else
{
return FALSE_VALUE;
}
}
int getMinItem()
{
struct treeNode *node,*prev=0;
node=root;
for(;node!=0;)
{
prev=node;
node=node->left;
}
if(prev==0)
{
return FALSE_VALUE;
}
else
{
return prev->item;
}
}
int getMaxItem()
{
struct treeNode *node,*prev=0;
node=root;
for(;node!=0;)
{
prev=node;
node=node->right;
}
if(prev==0)
{
return FALSE_VALUE;
}
else
{
return prev->item;
}
}
int rangeSearch(struct treeNode * node, int leftBound, int rightBound) //returns number of items in the
{
//write your codes here
if(node!=0)
{
if((node->item>=leftBound)&&(node->item<=rightBound))
{
return (1+rangeSearch(node->left,leftBound,rightBound)+rangeSearch(node->right,leftBound,rightBound));
}
else if((node->item<=leftBound))
{
if(node->item==leftBound)
{
return (1+rangeSearch(node->right,leftBound,rightBound));
}
else
{
return (rangeSearch(node->right,leftBound,rightBound));
}
}
else if((node->item>=rightBound))
{
if(node->item==rightBound)
{
return (1+rangeSearch(node->left,leftBound,rightBound));
}
else
{
return (rangeSearch(node->left,leftBound,rightBound));
}
}
}
else
{
return 0;
}
}
void printInOrder(struct treeNode * node, int height)
{
if(node==0) return ;
//print left sub-tree
printInOrder(node->left, height-1);
//print item
for(int i=0;i<height;i++)printf(" ");
printf("%03d\n",node->item);
//print right sub-tree
printInOrder(node->right, height-1);
}
int main(void)
{
initializeTree();
while(1)
{
printf("\n1. Insert item. 2. Delete item. 3. Search item. \n");
printf("4. Print height of tree. 5. Print height of an item. \n");
printf("6. PrintInOrder. 7. Calculate Depth 8. get MinItem. 9. get MaxItem.\n10. Range search. 11. Delete. 12. exit.\n");
int ch;
scanf("%d",&ch);
if(ch==1)
{
int item;
scanf("%d", &item);
insertItem(root, item);
}
else if(ch==2)
{
int item;
scanf("%d", &item);
deleteItem(root, item);
}
else if(ch==3)
{
int item;
scanf("%d", &item);
struct treeNode * res = searchItem(root, item);
if(res!=0) printf("Found.\n");
else printf("Not found.\n");
}
else if(ch==4)
{
int height = calcNodeHeight(root);
printf("Height of tree = %d\n", height);
}
else if(ch==5)
{
int item;
scanf("%d", &item);
int height = calcHeight(item);
printf("Height of %d = %d\n", item, height);
}
else if(ch==6)
{
int h = calcNodeHeight(root);
printf("\n--------------------------------\n");
printInOrder(root, h);
printf("--------------------------------\n");
}
else if(ch==12)
{
break;
}
else if(ch==7)
{
int i;
scanf("%d",&i);
printf("depth %d\n",calcDepth(i));
}
else if(ch==8)
{
printf("min item %d\n",getMinItem());
}
else if(ch==9)
{
printf("max item %d\n",getMaxItem());
}
else if(ch==10)
{
int item1,item2;
scanf("%d%d", &item1,&item2);
printf("Item number %d",rangeSearch(root,item1,item2));
}
else if(ch==11)
{
int a;
scanf("%d",&a);
deleteItem(root,a);
}
}
}