| 234-Trees |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Nodes
have 2, 3, or 4 children (1, 2, or 3 data items) |
||||||||||
| • | All
leaves are at the same level |
||||||||||
| • | Basic
rule for insertion: We hate 4-nodes |
||||||||||
| – | Split a
4-node whenever you find one while coming down the |
||||||||||
| tree |
|||||||||||
| – | Note:
this requires that parent is not a 4-node |
||||||||||
| – | New
items are always placed in a leaf |
||||||||||
| B |
| Splitting a 4-node |
|
|
|
| Place in |
||
| parent |
||
| A |
| C |
| A B C |
| CS409 - Spring
2000 |
| 7 |