What will this B-tree look like?

Posted by Phenom on Stack Overflow See other posts from Stack Overflow or by Phenom
Published on 2010-04-05T21:49:51Z Indexed on 2010/04/05 21:53 UTC
Read the original article Hit count: 171

Filed under:

The B-tree is of order 4, meaning that it can hold 4 pointers, and 3 keys.

The following is inserted: A G I Y

Since they can't all fit in one node, I know that the node will split. So I know there's going to be a root node with 2 child nodes after these things are inserted, but I don't know exactly what they'll look like.

© Stack Overflow or respective owner

Related posts about b-tree