The purpose of this workshop is to become familiar with the creation, search, and modification of B+-trees.
1. Construct a B+-tree for the following set of key values:
(8, 9, 11, 13, 17, 23, 25, 29, 35, 37)
Assume that the tree is initially empty and values are added in ascending order. Construct B+ trees for the cases where the number of pointers that will fit in one node is as follows:
a. Four
b. Six
c. Eight
2. For each B+-tree of exercise Ind-1, show the steps involved in the following queries:
a. Find records with a search-key value of 17.
b. Find records with a search-key value between 13 and 23, inclusive.
3. For each B+-tree of exercise Ind-1, show the form of the tree after each of the following operations:
a. Insert 15.
b. Insert 16.
c. Insert 14.
d. Delete 29.
e. Delete 25.