Session Details

Week 4, Session 13 — Fri Oct 4

Preparation

1. § 19.4

Due

1. Displayable Binary Tree

Topics

1. Doublets preview, meet partner
2. Finding kth element of a BST, need for rank
3. Definition of Height-balanced tree
4. Induction example: Fibonacci
5. Completely-balanced trees: nice idea, but ...
6. Height-balanced trees, maximum height

Outline

Resources

1. Slides
2. Doublets teams

HW Assigned

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