Question

1. Assume we have the following B+-tree of order 1. Each node in the index must have either 1 or 2 keys (i.e, 2 or 3 pointers), and the leaves can hold up to 2 entries.

          1. Assume we have the following B+-tree of order 1. Each node in the index
must have either 1 or 2 keys (i.e, 2 or 3 pointers), and the leaves can hold
up to 2 entries.

Added by Steve B.

Data Structures and Algorithms in Java (computer science, physics, engineering, chemistry)

Michael T. Goodrich, Roberto Tamassia,… 6th Edition

Chapter 8

Instant Answer

Solved by Expert Akash M

09/19/2023

Step 1

Then, inserting 27, 28, 29, and 30 will each create new leaf nodes at the bottom level, but will not change the height of the tree. Show more…

Show all steps

Thanks for your feedback!

a) What is the height of this tree after the following sequence of insertions: 26, 27, 28, 29, 30? Note that the current tree height is 2 (i.e., the number of pointers one must follow to get from the root to a leaf node). c) What is the minimum number of keys (no duplicates) one can insert to change the height of the original tree?