Lecture 22


Learning Outcomes

At the end of this lecture, you’ll be able to:

Lecture Plan

In this lecture, we'll cover the following lessons:

  1. Map ADT: The Abstraction
  2. Map ADT: The Interface
  3. Map ADT: Array-based Implementation
  4. OrderedMap ADT: The Interface
  5. OrderedMap ADT: BST Implementation
  6. BinarySearchTreeMap: Efficiency
  7. BinarySearchTreeMap: Balanced BST
  8. BBST: Balance Factor
  9. BBST: Exercise I
  10. BBST: Exercise II
  11. BBST: Height is O(log N)

Lessons marked with ⚡ contain exercise/activity.