| Deletion Algorithms |
|
|
|
|
|
|
|
|
|
|
|
|
| • | In
class, take 5 minutes and practice |
||||||||||
| creating
the following trees: |
|||||||||||
| – | insert: 30, 50, 70, 10, 20, 60, 15, 25, 85 |
||||||||||
| – | create:
BST, AVL, 2-3, 2-3-4, red-black |
||||||||||
| – | create:
a heap |
||||||||||
| – | now,
delete a leaf in each tree |
||||||||||
| – | now,
delete an internal node |
||||||||||