Question 3: 5 points
Draw the B+-tree of order 4 that you would get by starting with an empty tree and inserting the following values, in order:
Assume that the maximum number of keys in the B+-tree is 4 and the minimum is 2: the leaf nodes have same size as the
internal nodes (so they also store a maximum of 4 keys, the minimum is 2). The left pointer of a key-value in a parent node
points to entries in the child node which have key values less than this parent node key-value and the right pointer points to
the entries which have key values equal to or greater than this parent node key-value. Of course these values are less than
the next entry, if any, in the same parent node. To allow for some growth, the nodes should be 75% full. Give the figure for
the tree at points indicated by
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |