Discuss B-Trees
•Then, insert 55.
–The first step is to
locate the leaf of the tree in which this index belongs by determining where the search for 55 would terminate.
•We would find that we
would want to insert 55 in the node
containing 50,56,57, 58.
–But, that would cause
this node to contain 5 records. Since a node
can contain only 4 records, you must split this node into two...the new left node gets the two
smaller values and the new right node gets
the two larger values.