Assignments/test18.java at master · ranjanvittal/Assignments · GitHub

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
class TreeVisitor {
public static void main(String[] a) {
 System.out.println(new TV().Start());
}}

class TV{


public int Start(){

Tree root;

boolean ntb;

int nti;

MyVisitor v;

root = new Tree();
ntb = root.Init(16);
ntb = root.Print();
System.out.println(100000000);
ntb = root.Insert(8);
ntb = root.Insert(24);
ntb = root.Insert(4);
ntb = root.Insert(12);
ntb = root.Insert(20);
ntb = root.Insert(28);
ntb = root.Insert(14);
ntb = root.Print();
System.out.println(100000000);
v = new MyVisitor();
System.out.println(50000000);
nti = root.accept(v);
System.out.println(100000000);
System.out.println(root.Search(24));
System.out.println(root.Search(12));
System.out.println(root.Search(16));
System.out.println(root.Search(50));
System.out.println(root.Search(12));
ntb = root.Delete(12);
ntb = root.Print();
System.out.println(root.Search(12));

return 0;
}}
class Tree{

Tree left;

Tree right;

int key;

boolean has_left;

boolean has_right;

Tree my_null;


public boolean Init(int v_key){

key = v_key;
has_left = false;
has_right = false;

return true;
}
public boolean SetRight(Tree rn){

right = rn;

return true;
}
public boolean SetLeft(Tree ln){

left = ln;

return true;
}
public Tree GetRight(){


return right;
}
public Tree GetLeft(){


return left;
}
public int GetKey(){


return key;
}
public boolean SetKey(int v_key){

key = v_key;

return true;
}
public boolean GetHas_Right(){


return has_right;
}
public boolean GetHas_Left(){


return has_left;
}
public boolean SetHas_Left(boolean val){

has_left = val;

return true;
}
public boolean SetHas_Right(boolean val){

has_right = val;

return true;
}
public boolean Compare(int num1, int num2){

boolean ntb;

int nti;

ntb = false;
nti = num2+1;
if(num1<num2)
ntb = false;

else
if(!(num1<nti))
ntb = false;

else
ntb = true;


return ntb;
}
public boolean Insert(int v_key){

Tree new_node;

boolean ntb;

Tree current_node;

boolean cont;

int key_aux;

new_node = new Tree();
ntb = new_node.Init(v_key);
current_node = this;
cont = true;
while(cont)
{key_aux = current_node.GetKey();
if(v_key<key_aux)
{if(current_node.GetHas_Left())
current_node = current_node.GetLeft();

else
{cont = false;
ntb = current_node.SetHas_Left(true);
ntb = current_node.SetLeft(new_node);
}

}

else
{if(current_node.GetHas_Right())
current_node = current_node.GetRight();

else
{cont = false;
ntb = current_node.SetHas_Right(true);
ntb = current_node.SetRight(new_node);
}

}

}

return true;
}
public boolean Delete(int v_key){

Tree current_node;

Tree parent_node;

boolean cont;

boolean found;

boolean ntb;

boolean is_root;

int key_aux;

current_node = this;
parent_node = this;
cont = true;
found = false;
is_root = true;
while(cont)
{key_aux = current_node.GetKey();
if(v_key<key_aux)
if(current_node.GetHas_Left())
{parent_node = current_node;
current_node = current_node.GetLeft();
}

else
cont = false;


else
if(key_aux<v_key)
if(current_node.GetHas_Right())
{parent_node = current_node;
current_node = current_node.GetRight();
}

else
cont = false;


else
{if(is_root)
if(!current_node.GetHas_Right()&!current_node.GetHas_Left())
ntb = true;

else
ntb = this.Remove(parent_node,current_node);


else
ntb = this.Remove(parent_node,current_node);

found = true;
cont = false;
}


is_root = false;
}

return found;
}
public boolean Remove(Tree p_node, Tree c_node){

boolean ntb;

int auxkey1;

int auxkey2;

if(c_node.GetHas_Left())
ntb = this.RemoveLeft(p_node,c_node);

else
if(c_node.GetHas_Right())
ntb = this.RemoveRight(p_node,c_node);

else
{auxkey1 = c_node.GetKey();
auxkey2 = (p_node.GetLeft()).GetKey();
if(this.Compare(auxkey1,auxkey2))
{ntb = p_node.SetLeft(my_null);
ntb = p_node.SetHas_Left(false);
}

else
{ntb = p_node.SetRight(my_null);
ntb = p_node.SetHas_Right(false);
}

}


return true;
}
public boolean RemoveRight(Tree p_node, Tree c_node){

boolean ntb;

while(c_node.GetHas_Right())
{ntb = c_node.SetKey((c_node.GetRight()).GetKey());
p_node = c_node;
c_node = c_node.GetRight();
}
ntb = p_node.SetRight(my_null);
ntb = p_node.SetHas_Right(false);

return true;
}
public boolean RemoveLeft(Tree p_node, Tree c_node){

boolean ntb;

while(c_node.GetHas_Left())
{ntb = c_node.SetKey((c_node.GetLeft()).GetKey());
p_node = c_node;
c_node = c_node.GetLeft();
}
ntb = p_node.SetLeft(my_null);
ntb = p_node.SetHas_Left(false);

return true;
}
public int Search(int v_key){

Tree current_node;

int ifound;

boolean cont;

int key_aux;

current_node = this;
cont = true;
ifound = 0;
while(cont)
{key_aux = current_node.GetKey();
if(v_key<key_aux)
if(current_node.GetHas_Left())
current_node = current_node.GetLeft();

else
cont = false;


else
if(key_aux<v_key)
if(current_node.GetHas_Right())
current_node = current_node.GetRight();

else
cont = false;


else
{ifound = 1;
cont = false;
}


}

return ifound;
}
public boolean Print(){

boolean ntb;

Tree current_node;

current_node = this;
ntb = this.RecPrint(current_node);

return true;
}
public boolean RecPrint(Tree node){

boolean ntb;

if(node.GetHas_Left())
{ntb = this.RecPrint(node.GetLeft());
}

else
ntb = true;

System.out.println(node.GetKey());
if(node.GetHas_Right())
{ntb = this.RecPrint(node.GetRight());
}

else
ntb = true;


return true;
}
public int accept(Visitor v){

int nti;

System.out.println(333);
nti = v.visit(this);

return 0;
}}
class Visitor{

Tree l;

Tree r;


public int visit(Tree n){

int nti;

if(n.GetHas_Right())
{r = n.GetRight();
nti = r.accept(this);
}

else
nti = 0;

if(n.GetHas_Left())
{l = n.GetLeft();
nti = l.accept(this);
}

else
nti = 0;


return 0;
}}
class MyVisitor extends Visitor{


public int visit(Tree n){

int nti;

if(n.GetHas_Right())
{r = n.GetRight();
nti = r.accept(this);
}

else
nti = 0;

System.out.println(n.GetKey());
if(n.GetHas_Left())
{l = n.GetLeft();
nti = l.accept(this);
}

else
nti = 0;


return 0;
}}