Question: DATABASE SYSTEMS QUESTION Consider a B+ tree with n = 4. The notation k* in a leaf node corresponds to a pair of , where
DATABASE SYSTEMS QUESTION
Consider a B+ tree with n = 4. The notation k* in a leaf node corresponds to a pair of , where k is the search key value and p is the pointer to the file record with the key value k.
(a) Draw the tree after inserting the following keys in the given order. 12, 3, 4, 15, 11, 2, 16, 1, 14, 10, 13.
(b) Draw the tree after inserting the following keys in the given order. 13, 14, 16, 1, 2, 15, 3, 10, 11, 12, 4.
(c) Draw the tree after inserting the following keys in the given order. 3, 10, 1, 2, 4, 11, 14, 16, 12, 13, 15.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
