DBMS

1. B Trees

2. Sample B tree

5. Sample B tree

7. B-tree of order 5 all internal nodes have at least ceil(5 / 2) = ceil(2.5) = 3 children maximum number of children that a node can have is 5

10. Inserting H

11. Inserting E, K, and Q proceeds without requiring any splits:

12. Inserting M requires a split

13. The letters F, W, L, and T are then added without needing any split

14. Adding Z

15. Inserting D

16. Inserting s

17. DELETION (H)

18. Delete T

19. Delete R

20. Delete E