Question

Insert the following values into an initially empty B+ tree with parameter d=2 17, 11, 50, 22, 5, 35, 42, 60, 15, 30, 25, 27, 37, 40, 20.

Answer 1

B+ Tree

Step 1: Insert keys 17 & 11       

Step 2: Insert key 50                  

         

Node Contains too many keys so perform Splitting

Step 3: Insert key 22

Step 4: Insert key 5                                                                

Step 5: Insert key 35     

Step 6: Insert key 42                                                                          

Step 7: Insert key 60           

Step 8: Insert key 15                                                                         

Step 9: Insert keys 30                 

Step 10: Insert key 25                                                                    

Step 11: Insert key 27

Step 12: Insert key 37                 

Step 13: Insert key 40           

Step 14: Insert key 20

Which is Required B+ Tree after insertion Operations