| Discuss B-Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | So,
we can require that B-trees be balanced |
|||||||||||
| (as
we saw with 2-3 trees)... |
||||||||||||
| – | but
the number of children for any internal |
|||||||||||
| node
should be able to be somewhere between |
||||||||||||
| m and
(m div 2)+1. |
||||||||||||
| • | We
call this a B-Tree of degree m |
|||||||||||
| • | This
requires that all leaves be at the same |
|||||||||||
| level
(balanced). |
||||||||||||