| Review for the Final Exam |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Explain
the process of inserting data into a |
||||||||||
| 2-3
tree. |
|||||||||||
| • | Explain
the process of deleting a node from |
||||||||||
| a BST |
|||||||||||
| – | what
special cases do we need to consider |
||||||||||
| – | how
do we delete a node that has two children? |
||||||||||
| (write
the algorithm) |
|||||||||||