1. B+-Trees 1

2. 2 Motivation for B+ Trees Reduce the storage of internal nodes to reduce disk access Link the leaves to make traversing the tree faster ***Reward***: What is the advantage of B-Tree compared with B+tree?

3. B+-Trees3 Inserting into B+ tree Insert 9

4. B+-Trees4

5. 5 Inserting into B+ tree Insert 3

6. B+-Trees6

7. 7 Deleting from B+ tree Delete 8, assuming that right sibling is checked for redistribution

8. B+-Trees8

9. 9 Deleting from B+ tree Insert 8, assuming that left sibling is checked for redistribution

10. B+-Trees10

11. B+-Trees11 10-5 Insert 46, then delete 52

12. B+-Trees12

13. B+-Trees13 10-6 Delete 91

14. B+-Trees14

15. B+-Trees15 ***Reward*** 10-8 successively deleting the data entries with keys 32, 39, 41, 45, and 73

16. B+-Trees16