Quiz 4 study guide

• 2-3 trees, hash tables, and heaps lecture material and textbook material (i.e. running times) (read the chapters associated with these data structures).
• Hash table - Hashing values, what makes good hash functions and bad hash functions, what are good/bad table sizes, collision techniques - seperate chaining, linear probing, quadratic probing, and double hashing.
• Show sample heap or hash table operations (like the homework questions)