Session Details

Week 3, Session 7 — Thu Mar 25

Preparation

Due

  1. Stacks and Queues

Topics

  1. More recursive binary tree methods.
  2. Binary tree traversals

Outline

  1. [10 min] Announcements.
  2. [10 min] Discuss use of NULL_NODE to simplify code
  3. [20 min] Implementing recursive O(n) contains
  4. [25 min] Implementing toArrayList
  5. [ 5 min] Break
  6. [30 min] Exam 1 review, questions.

Resources

  1. Slides
  2. Binary Tree Traversal Visualization (use non-Chrome browser)
  3. Doublets teams

HW Assigned

  1. See Preparation, Due, and Major Programs columns on the main schedule page