CS 330
Lecture 20
- More examples with insertions in a B+ tree (2-3 tree).
- Finish B+ trees: deletions.
- Start new topic: hashing. Solving collisions. Open and closed hashing.
- Extendible hashing. The dynamic hashing algorithm of Fagin et al. Outline.
Ileana Streinu