2-3-4 trees

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.

bump. Also I'm disappoint /prog/, this is a reasonably standard data structure and you should know about it.

>>2
Whether we know and whether we care are unrelated. Besides, you should know about it.

>Whether we know and whether we care are unrelated.
DrEvilRiiiight.jpg

>Besides, you should know about it.
Sure, I started learning about them like a few minutes before starting the thread, why the FUCK should I know about them, motherfucker?

Back to the imageboards, please.

Read SICP.

The parent cannot be a 4-node.

>5
There is no fucking imageboard for programming, so go fuck your mother.

>6
Of course the parent can be a 4-node. Wtf is this shit? Am I talking to 9 year old BASIC programmers?


For fucks sake you suck.

>>7
There is no fucking imageboard for programming, so go fuck your mother.
Sure there is, /pr/

>>1
Why don't you try harder before coming here for help.
>>2
Perhaps you should know about it.
>>4
DrEvilRiiiight.jpg
See >>5
Sure, I started learning about them like a few minutes before starting the thread
Why don't you try harder before coming here for help.
>>7
For fucks sake you suck.
You're not going to get any answers that way. I've not yet seen any instance of 'please' from you.

Also, learn to quote.

>>7
Of course the parent can be a 4-node.
No. If you follow through the algorithm, there is no way it can be a 4-node, you total fucking moron.

>>9
I've not yet seen any instance of 'please' from you.
Humility and accepting there are things you don't know yet are for faggots.

ITT: summerfriends