Name:________________________________________

1. (1 pt) How does the B-tree insert algorithm ensure that all leaves are always at the same level?
   
   
   
   
   
   
   
   
   
   
2. (1 pt) What is the load factor of a hash table?
   
   
   
   
   
   
   
3. (1 pt) What is a collision, in the context of a hash table?
   
   
   
   
   
   
   
   
4. (1 pt) Informally, what is the behavior of a hash function that is ideal for chaining?
   
   
   
   
   
   
   
   
   
   
5. (1 pt) Informally, what is the behavior of a hash function that is ideal for open addressing?