| Discuss B-Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Each
node contains between m-1 and (m |
|||||||||||
| div
2) values. |
||||||||||||
| • | Each
internal node has one more child than |
|||||||||||
| it
has values. |
||||||||||||
| • | There
is one exception; |
|||||||||||
| – | the
root of the tree can contain as few as 1 |
|||||||||||
| value
and can have as few as two children (or |
||||||||||||
| none
-- if the tree consists of only a root!). |
||||||||||||