Quiz 4 study guide

• 2-3 trees, hash tables, red-black trees - lecture material and textbook material (read the chapters associated with these data structures).
• Red-black trees, 2-3 trees, and hash tables - running times
• 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.
• Make sure you do homework problems associated with hash tables and 2-3 trees
• You will not have to do operations on a red-black tree - that will be on the final
• Coding - You should be able to write code for the simple 2-3 tree operations such as search and the order traversals.
• Choosing a good ADT - Given a particalar set of operations or a defined project, analyze and choose the best ADT implementation