In this lab assignment, you will implement and prove the correctness of
binary search trees.
To do this assignment, download the source code
and do all of the exercises, denoted by EXERCISE in that file.
If you are done with lab0 before the deadline (e.g., because you skipped the
SF homeworks), then try the challenge.