B-trees that use redistribution on insertion

Posted by Phenom on Stack Overflow See other posts from Stack Overflow or by Phenom
Published on 2010-04-13T08:40:35Z Indexed on 2010/04/13 8:42 UTC
Read the original article Hit count: 274

Filed under:

If I insert the following keys into a B-tree of order 4 (meaning 4 pointers and 3 elements in each node), I get the following B-tree.

  G
 / \
A   IY

Would it look any different if redistribution on insertion were used? How does redistribution on insertion work?

© Stack Overflow or respective owner

Related posts about b-tree