| Discuss B-Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Therefore,
with an external search tree, |
|||||||||||
| – | we
allow each node to have as many children as |
|||||||||||
| possible. |
||||||||||||
| – | If a
node is to have m children, then you must be |
|||||||||||
| able
to allocate enough memory for that node to |
||||||||||||
| contain
the data and m pointers to the node. |
||||||||||||
| – | The
data such a node must have must be m-1 key |
|||||||||||
| values. |
||||||||||||