Name – Yashraj Kunwar

Student number – 3125511

Course – ACS-3902-003

Assignment no 10
Exercise 10.1

A PARTS file with Part# as key field includes records with the following Part# values: 24, 28,

39, 43, 47, 50, 69, 75, 8, 49, 33, 38, 23, 65, 37, 60, 46, 92, 48, 71, 56, 59.

Suppose the search field values are inserted in the given order in a B+

-tree of order p=4 and pleaf =3; Show how the tree looks like after each split that must be

performed and show how the final tree looks like.

Exercise 10.2

Suppose that the following search field values are deleted, in the given order, from the B+

-tree of Exercise 10.1. The deleted values are: 65, 75, 43, 92, 59, 37.

When deciding how to merge or redistribute nodes use the following order of priorities:

• Redistribute the entries with the left sibling node.

• If the above is not possible, redistribute the entries with the right sibling node.

• If all of the above is not possible, merge with the left sibling node.

• If all of the above is not possible, merge with the right sibling node.
Show the tree after each merge/redistribution of leaf-nodes. Also show the final tree after all

deletions have been performed