-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsample_output.txt
795 lines (736 loc) · 20.4 KB
/
sample_output.txt
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
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
/Users/stevenang/CLionProjects/BTree2/cmake-build-debug/BTree2
***********************************************************************************************
* CSCI 6620 Data Struture *
* Programming Assignment No. 8D *
* BTree *
* *
* Submitted by: ANG, STEVEN KHO *
* *
* This program can: *
* 1. Create a BTree . *
* 2. User can do the following actions: *
* - Add an item to the tree *
* - Search the nodes that contains the item you looking for. *
* - Print out the complete tree in In-Order Traversal *
* - Print out the complete tree in Level-Order Traversal *
* *
***********************************************************************************************
Please choose from the following action. Please enter the number of action you want to execute:
1. Insert an item to the BTree.
2. Insert a data by reading data file.
3. Search an item from BTree.
4. Print in In-Order Traversal.
5. Print in Level-Order Traversal
6. Quit
Please enter the action code: 2
Read DATA File and Build a BTree
Please enter your data file's name: data.txt
The file name you inputed is 'data.txt'.
File 'data.txt' opened.
BTree - Insert 40
BTNode - insertItem
The node is a leaf
Insert 40 at [].
After insertion: [40].
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [40].
BTree - Insert 70
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is a leaf
Insert 70 at [40].
After insertion: [40, 70].
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [40, 70].
BTree - Insert 65
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is a leaf
Insert 65 at [40, 70].
After insertion: [40, 65, 70].
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [40, 65, 70].
BTree - Insert 10
Root is no need for split yet
Root's item count: 3
BTNode - insertItem
The node is a leaf
Insert 10 at [40, 40, 65].
After insertion: [10, 40, 65, 70].
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [10, 40, 65, 70].
BTree - Insert 100
Root is no need for split yet
Root's item count: 4
BTNode - insertItem
The node is a leaf
Insert 100 at [10, 40, 65, 70].
After insertion: [10, 40, 65, 70, 100].
BTNode - End of Insert
The root node is full. Current root will be splitted.
Split Node
Move 70 to new node.
Move 100 to new node.
Size of Root node: 1
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 20
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 20 at [10, 40].
After insertion: [10, 20, 40].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 30
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 30 at [10, 20, 40].
After insertion: [10, 20, 30, 40].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 80
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 80 at [70, 100].
After insertion: [70, 80, 100].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 85
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 85 at [70, 80, 100].
After insertion: [70, 80, 85, 100].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 5
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 5 at [10, 10, 20, 30].
After insertion: [5, 10, 20, 30, 40].
BTNode - End of Insert
Item count: 5
Split Node
Move 30 to new node.
Move 40 to new node.
Size of Root node: 2
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65].
BTree - Insert 90
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 90 at [70, 80, 85, 100].
After insertion: [70, 80, 85, 90, 100].
BTNode - End of Insert
Item count: 5
Split Node
Move 90 to new node.
Move 100 to new node.
Size of Root node: 3
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85].
BTree - Insert 392
Root is no need for split yet
Root's item count: 3
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 392 at [90, 100].
After insertion: [90, 100, 392].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85].
BTree - Insert 201
Root is no need for split yet
Root's item count: 3
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 201 at [90, 100, 392].
After insertion: [90, 100, 201, 392].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85].
BTree - Insert 111
Root is no need for split yet
Root's item count: 3
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 111 at [90, 100, 201, 201].
After insertion: [90, 100, 111, 201, 392].
BTNode - End of Insert
Item count: 5
Split Node
Move 201 to new node.
Move 392 to new node.
Size of Root node: 4
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85, 111].
BTree - Insert 50
Root is no need for split yet
Root's item count: 4
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 50 at [30, 40].
After insertion: [30, 40, 50].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85, 111].
BTree - Insert 55
Root is no need for split yet
Root's item count: 4
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 55 at [30, 40, 50].
After insertion: [30, 40, 50, 55].
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [20, 65, 85, 111].
BTree - Insert 60
Root is no need for split yet
Root's item count: 4
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 60 at [30, 40, 50, 55].
After insertion: [30, 40, 50, 55, 60].
BTNode - End of Insert
Item count: 5
Split Node
Move 55 to new node.
Move 60 to new node.
Size of Root node: 5
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
The root node is full. Current root will be splitted.
Split Node
Move 85 to new node.
Move node 3 to spot 0 of the newNode.
Move 111 to new node.
Move node 4 to spot 1 of the newNode.
Size of Root node: 1
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 87
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 87 at [90, 90].
After insertion: [87, 90, 100].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 56
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 56 at [55, 60].
After insertion: [55, 56, 60].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 78
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 78 at [70, 80].
After insertion: [70, 78, 80].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 777
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 777 at [201, 392].
After insertion: [201, 392, 777].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 888
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 888 at [201, 392, 777].
After insertion: [201, 392, 777, 888].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 911
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 911 at [201, 392, 777, 888].
After insertion: [201, 392, 777, 888, 911].
BTNode - End of Insert
Item count: 5
Split Node
Move 888 to new node.
Move 911 to new node.
Size of Root node: 3
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 103
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 103 at [87, 90, 100].
After insertion: [87, 90, 100, 103].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 176
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 176 at [201, 201].
After insertion: [176, 201, 392].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 566
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 566 at [176, 201, 392].
After insertion: [176, 201, 392, 566].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 556
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 556 at [176, 201, 392, 566].
After insertion: [176, 201, 392, 556, 566].
BTNode - End of Insert
Item count: 5
Split Node
Move 556 to new node.
Move 566 to new node.
Size of Root node: 4
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 345
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 345 at [176, 201].
After insertion: [176, 201, 345].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 890
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 890 at [888, 911].
After insertion: [888, 890, 911].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 987
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 987 at [888, 890, 911].
After insertion: [888, 890, 911, 987].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 639
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 639 at [556, 566].
After insertion: [556, 566, 639].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 123
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 123 at [176, 176, 201].
After insertion: [123, 176, 201, 345].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65].
BTree - Insert 234
Root is no need for split yet
Root's item count: 1
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 234 at [123, 176, 201, 345].
After insertion: [123, 176, 201, 234, 345].
BTNode - End of Insert
Item count: 5
Split Node
Move 234 to new node.
Move 345 to new node.
Size of Root node: 5
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
Item count: 5
Split Node
Move 392 to new node.
Move node 3 to spot 0 of the newNode.
Move 777 to new node.
Move node 4 to spot 1 of the newNode.
Size of Root node: 2
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
BTree - Insert 101
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 101 at [87, 90, 100, 103].
After insertion: [87, 90, 100, 101, 103].
BTNode - End of Insert
Item count: 5
Split Node
Move 101 to new node.
Move 103 to new node.
Size of Root node: 3
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
BTree - Insert 399
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 399 at [556, 556, 566].
After insertion: [399, 556, 566, 639].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
BTree - Insert 500
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 500 at [399, 556, 556, 566].
After insertion: [399, 500, 556, 566, 639].
BTNode - End of Insert
Item count: 5
Split Node
Move 566 to new node.
Move 639 to new node.
Size of Root node: 3
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
BTree - Insert 799
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 799 at [888, 888, 890, 911].
After insertion: [799, 888, 890, 911, 987].
BTNode - End of Insert
Item count: 5
Split Node
Move 911 to new node.
Move 987 to new node.
Size of Root node: 4
Size of new node: 2
Size of Child Node: 2
Split Node - End
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
BTree - Insert 666
Root is no need for split yet
Root's item count: 2
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is not a leaf
BTNode - insertItem
The node is a leaf
Insert 666 at [566, 639].
After insertion: [566, 639, 666].
BTNode - End of Insert
BTNode - End of Insert
BTNode - End of Insert
BTree - End of Insert
Root Node after insertion: [65, 201].
Please choose from the following action. Please enter the number of action you want to execute:
1. Insert an item to the BTree.
2. Insert a data by reading data file.
3. Search an item from BTree.
4. Print in In-Order Traversal.
5. Print in Level-Order Traversal
6. Quit
Please enter the action code: 3
Search BTree:
Please enter the number you are looking for: 100
The number you are looking for is 100
Item found. The node contains the target is [85, 100, 111].
Please choose from the following action. Please enter the number of action you want to execute:
1. Insert an item to the BTree.
2. Insert a data by reading data file.
3. Search an item from BTree.
4. Print in In-Order Traversal.
5. Print in Level-Order Traversal
6. Quit
Please enter the action code: 4
Print BTree in IN-Order Traversal: 5 10 20 30 40 50 55 56 60 65 70 78 80 85 87 90 100 101 103 111 123 176 201 234 345 392 399 500 556 566 639 666 777 799 888 890 911 987
Please choose from the following action. Please enter the number of action you want to execute:
1. Insert an item to the BTree.
2. Insert a data by reading data file.
3. Search an item from BTree.
4. Print in In-Order Traversal.
5. Print in Level-Order Traversal
6. Quit
Please enter the action code: 5
Print BTree in Level-Order Traversal.
Level: 1
[65, 201].
Level: 2
[20, 50].
[85, 100, 111].
[392, 556, 777, 890].
Level: 3
[5, 10].
[30, 40].
[55, 56, 60].
[70, 78, 80].
[87, 90].
[101, 103].
[123, 176].
[234, 345].
[399, 500].
[566, 639, 666].
[799, 888].
[911, 987].
Please choose from the following action. Please enter the number of action you want to execute:
1. Insert an item to the BTree.
2. Insert a data by reading data file.
3. Search an item from BTree.
4. Print in In-Order Traversal.
5. Print in Level-Order Traversal
6. Quit
Please enter the action code: 6
Thank you
Process finished with exit code 0