Lab 0: binary search trees

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.

Questions or comments regarding 6.826? Contact us on Piazza or send e-mail to the 6.826 staff at 6826-staff@lists.csail.mit.edu.

Creative Commons License