- "2950" needs to be added.
- The tree is searched for the record by labeling the root
pointers 0..4
The key "2950" is larger than the first key "1069", so pointer 1
followed.
The leaf pointers are followed (0...), "1069","2010","
2015". "3010" is too large so the key needs to be added to this leaf.
- The number of keys in the leaf now exceeds the Bktfr (4) so
the leaf is split (2:3).
- The smallest key in the Right hand side (RHS)
"2015" is becomes the new parent and is added to the root leaf.
- "1041" and "1278" are then added.
[Rev 13/03/99] 12/3/99 © 1999 V/2-Com (Verhaart), P O Box 8415, Havelock
North, New Zealand.
