database - What will be the result of the following insertion in a B+ tree ? -


i going through algorithm insert keys in b+ tree based indexing scheme. suppose tree empty, , values inserted in order are- 73,108,100,120,125,105. proceeded follows- insert 73

enter image description here

insert 108

enter image description here

insert 100

enter image description here

insert 120

enter image description here

insert 125

enter image description here

according professor, insertion should result in like- (120 linked 125, , no key value of 125 in level above, in case image's not clear)

enter image description here

insert 105 got confused. having 3 different results, depending on whether follow professor's algo,follow instinct, or follow online simulation tool animates insertions in b+ tree)

my solution- enter image description here

my professors' soln- enter image description here

online tool's soln-

enter image description here

can guide me , tell me of above solutions is/are correct ?


Comments

Post a Comment