11. [3 points] Why do binary search trees often run in their worst-case run time (as opposed to hash tables, which rarely run in their worst-case run time)?

12. [3 points] How would you implement findMax() in a hash table?

11. [3 points] Why do binary search trees often run in their worst-case run time (as opposed to hash tables, which rarely run in their worst-case run time)? 12. [3 points] How would you implement findMax () in a hash table