Lesson 8.1: BST remove
Class Meeting:
| Section | Slides | Annotated Slides | Video |
| 12–1PM | 8.1-bst-remove-203-1221.pdf Download 8.1-bst-remove-203-1221.pdf | PDF Download PDF |
On Zoom Cloud Recordings |
| 1–2PM | 8.1-bst-remove.pdf Download 8.1-bst-remove.pdf | 8.1-bst-remove-1pm-annotated.pdf Download 8.1-bst-remove-1pm-annotated.pdf |
On Zoom Cloud Recordings |
| 4–5PM | 8.1-bst-remove.pdf Download 8.1-bst-remove.pdf | 8.1-bst-remove-4pm-annotated.pdf Download 8.1-bst-remove-4pm-annotated.pdf |
On Zoom Cloud Recordings |
Readings:
- Carrano & Henry : Chapter 15.3, 16.1 - 16.3 (BST)
Summary:
In this class, we review our definition of binary search trees, and then implement BST removal. We conclude by making observations about BST suitability for an implementation of ADT Dictionary.
Learning Outcomes:
- Design and analyze BST Remove
- BST as an implementation of a Dictionary