In B-trees which element gets promoted when the node splits
Posted
by Phenom
on Stack Overflow
See other posts from Stack Overflow
or by Phenom
Published on 2010-04-04T16:48:10Z
Indexed on
2010/04/04
16:53 UTC
Read the original article
Hit count: 195
b-tree
Let's say there is a B-tree of order 8. This means it can have 8 pointers and 7 elements. Say the letters A through G are stored in this B-tree. So this B-tree is just a single node containing 7 elements.
Then you try to insert J into the tree. There's no room, so you have to split the node and create a new root node. Which element gets promoted up into the root node?
© Stack Overflow or respective owner