Exercise 8        Name __________________        Score __/ 15
Document last modified: 

1. (2) For what values of t is the tree below a legal B-tree?

   

         

2. (4) Show all legal B-trees of minimum degree 2 that represent {1, 2, 3, 4, 5}

    

                      

3. (5) Show the results of inserting the keys:

   F S Q K C L H T V W M R N P A B X Y D Z E

   in order into an empty B-tree with minimum degree 2. Only draw the configurations of the tree just before some node must split and also draw the final configuration.

   
    

4. (5) Show the results of deleting C, P and V in order from the tree of Figure 18.8(f).