Discuss B-Trees
•Ideally,
you should structure these types of trees such that every internal node has m children and all
leaves are at the same level.
•For
example, if m is 5 -- then every node should have 5 children and 4 data values.
–But,
this is too difficult to maintain when you are doing a variety of insertions and
deletions.