asymptotic bound

Show the results of inserting the keys 8, 25, 20, 4, 18, 6, 3, 30, 7, 10, 40, 33, 42, 38, 2, 5, 53, 47, 32, 41, 1 in order into an empty B-tree with minimum degree 2. Draw only the configurations of the tree just before some node must split, and also draw the final configuration.

CP5602 Assignment Answer all questions in a single document. Each question should begin on a new page. Providing an answer without explanation in which how did you achieve it, is not acceptable. Show all your work (Partial mark applies). If you use pen-and-paper you may submit a scan of your worksheet. Upload your solution to […]

Scroll to top