Answer Happy

B+ trees in DBMS plays an important role in supporting equality
and range search.
Construct a B+ tree. Suppose each node can hold up to
3 pointers and 2 keys.
Insert the following 7 keys (in order from left to
right):
1, 3, 5, 7, 9, 11, 6
After the insertions, which of the following key pairs resides
in the same leaf node?
Group of answer choices
5, 6
3, 5
1, 3
6, 7
Question: How
many pointers (parent-to-child and
sibling-to-sibling) do you chase to find all
keys between 5 and 7?
Group of answer choices
5
2
6
3
4
Question:
Refer to the previous question.
After the key "3" is deleted, what is the key
value in the root node?
Group of answer choices
7
3
1
5
9