Question

Consider the B+ tree index shown in Figure 1. Each intermediate node can hold up to five pointers and four key values. Each leaf can hold up to four records, and leaf nodes are doubly linked as usual, although these links are not shown in the figure. Answer the following questions. Show every step of the insertion and explain the process. 34.21-4 ostas 704 94 986 99-100-105 944954964974 LS Figure 1. (1). Insert a record with search key 109 into the tree. (2). Delete the record with search key 81 from the original tree.

Answer 1

MSD 125 Notes Be well as Given 11 35 1304 tot U de Gruyoqm|7o* J 5x1524 | 58164 Tuza usht] Bt tree I insert a key 109 into this free o we need to Insert it in the Iz] Node and create a leaf Node as well as follows BES CONFIDENT

| 10 [[20][30][0] | [৭ি০ ||৭|| 107| BিT হি ও]] * •|| rি | দে ||| চি« [5.* [F]

2) Deleting search 81 from free Since 81k is in Remove Leaf Node, we just it from there. need to 20 30 to 67*(70417. - 1987[xle? 736 | 2 or 1 wet feet