Name: Anonymous 2010-06-27 14:48
Hi, take a look at the insertion process as described here:
http://en.wikipedia.org/wiki/2-3-4_tree#Insertion
In the very first step, the last part reads:
"Otherwise, push the middle value up into the parent node. Ascend into the parent node."
But what if the parent node is already a 4-node? (That is: a node with three values which can have up to 4 children.)
Perhaps some alternative website where it's explained in more detail.
http://en.wikipedia.org/wiki/2-3-4_tree#Insertion
In the very first step, the last part reads:
"Otherwise, push the middle value up into the parent node. Ascend into the parent node."
But what if the parent node is already a 4-node? (That is: a node with three values which can have up to 4 children.)
Perhaps some alternative website where it's explained in more detail.