We are skipping Chapter 5 on hash tables since they are covered in MCS 401. Also, Chapter 6 on Binary Trees was covered in MCS 275 so I just reviewed it quickly. I then started talking about Random Binary Search Trees and treaps.
Exercises 6..12 and 6..13 from this page. Also, do Exercise 6..14 but just write pseudocode. Your pseudocode should use the list ADT methods to create a list of all elements smaller than x.