Simple B+ Tree Help

[tmso]

Hi, I'm given a B+ Tree that has:

M = 3 = Number of children
L = 2 = Number of int each node holds

We are to insert a series of numbers, and match this output:

Inserting 3.
Leaf: 3

Inserting 4.
Leaf 3 4

Inserting 8.
Internal: 3 4
Leaf: 3
Leaf: 4 8

Inserting 1.
Internal 1 4
Leaf: 1 3
Leaf: 4 8

Inserting 10.
Internal: 1 4 8
Leaf: 1 3
Leaf: 4
Leaf: 4 8

Inserting 2.
Internal: 1 3 8
Leaf: 1 2
Leaf: 3 4
Leaf: 8 10

etc. . .

I can't quite seem to visualize the tree..

and here's a tip: When a node splits, the new node created will always contain at least as many entries as the remaining old node, and will contain the larger values.


someone plz help!