### Comp 271-400 Week 7

Cuneo 311, 4:15-8:15

**Readings**:

Bailey chapter 5 section 2 on recursion

Bailey chapter 6, on sorting.

Bailey chapter 9 section 4 on Singly Linked Lists

Bailey chapter 15, section 4, on Hash Tables.

Bailey chapter 3, on a Vector class

Morin 3.1: Singly Linked Lists

Morin 5.1: Chained Hash Table

Study Guide

Lab 5 with multiplicities

Skiplists: Morin Chapter 4

Finish AVL trees:

- sequence of insertions of increasing values, where all unbalanced
nodes are R-R
- mixed insertions where there are R-L and L-R cases, requiring two
rotations

B-Trees

Red-black trees (and 2-4 trees)

graph traversal: tzuul

Compiler

- Forward references
- Data structures for expressions