|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
For
next time,
|
|
|
|
– |
practice
creating each of these trees on your
|
|
|
|
own
so that you understand the insertion
|
|
|
|
algorithms
|
|
|
|
– |
think
about what would be needed to remove
|
|
|
|
nodes
from these trees
|
|
|
|
– |
try
deleting a leaf and an internal node from you
|
|
|
2-3,
AVL, and 2-3-4 trees
|
|
|
|