In B-trees, this element advances when a split node

Question

Say there is a B-tree of order 8. This means that it can have 8 pointers and 7 elements. Say the letters AG are stored in this B-tree. Thus, this B-tree is just one node containing 7 elements.

Then you try to insert J into the tree. There is no place, so you need to split the node and create a new root root. Which element gets promoted to the root of the node?

Answer 1

If you want to insert a new element into a full node (with keys 2*t - 1)

• you split it by choosing the median key node (key, middle)
• t-1 ( )
• node
• , , .