Lesson 6.3: BST insert/find

Class Meeting:

Section Slides Annotated Slides Video
12–1PM 6.3-bst-insert-find-203-1221.pdf Download 6.3-bst-insert-find-203-1221.pdf PDF Download PDF

On Zoom Cloud Recordings

1–2PM 6.3-bst-operations.pdf Download 6.3-bst-operations.pdf   6.3-bst-operations-1pm-annotated.pdf Download 6.3-bst-operations-1pm-annotated.pdf 

On Zoom Cloud Recordings

4–5PM 6.3-bst-operations.pdf Download 6.3-bst-operations.pdf   6.3-bst-operations-4pm-annotated.pdf Download 6.3-bst-operations-4pm-annotated.pdf 

On Zoom Cloud Recordings


Readings:

  • Carrano & Henry : Chapter 15.3, 16.1 - 16.3 (BST)

 


Summary:

In this video, we first define binary search trees, and then evaluate them as candidates for implementing the Dictionary ADT.


Learning Outcomes:

  • Define a Binary Search Tree
  • Design and analyze BST Insert
  • Design and analyze BST Find