As part of your review process, I recommend you study:
Notes from class
Reread book chapter
Lab assignments
Look over exercises at the end of the chapter in the book.
Chapter Twelve: Advanced
Implementations of Tables
Be able to define 2-3 tree.
Know how to conduct a search by key in a 2-3 tree.
If I give you a sketch of a 2-3 tree and tell you to insert
and/or delete some keys, you should be able to accurately sketch how
the tree will look after each operation is carried out.
Understand using trees to implement the ADT Table, why balance
is important, the basic types of balanced trees, and what trade-offs we
make to keep the trees balanced.
Know the definition of hashing and how to use it to implement
the ADT Table. (Including being able to write pseudocode function
implementations.)
Know what a hash function is and the qualities of a good hash
function.
Understand the need for collision resolution. Know the
definitions of open addressing and separate chaining and understand how
to implement these forms of collision resolution.