Session Details

Week 4, Session 10 — Mon Dec 21

Preparation

  1. § 19.1

Due

  1. Doublets

Topics

  1. Binary Search Tree (BST) methods: insert, remove, contains.

Outline

  1. [10 min] Questions, including about Exam 1
  2. [20 min] BST intro, design insert.
  3. [5 min] Break
  4. [40 min] contains, insertion, deletion
  5. [30 min] Work time

Resources

  1. Slides

HW Assigned