| Discuss B-Trees |
|
|
|
|
|
|
|
|
|
|
| • | Notice,
a 2-3 tree is a B-tree of degree 3. |
||||||||
| • | Data
can be inserted into a B-tree using the same |
||||||||
| strategy |
|||||||||
| of splitting and |
|||||||||
| merging nodes |
|||||||||
| that we discussed |
|||||||||
| • | Here
is a B-tree |
||||||||
| of degree 5: |
|||||||||