|Binary search trees||3/1|
|Max flow, min cut||4/19|
Grading policy: Grades on the problem set questions will be: 4 (correct), 3 (minor mistake), 2 (major mistake), 1 (poor try) or 0 (all wrong or not submitted).
Lateness Policy: Late problem sets will not be accepted without a University sanctioned excuse or prior approval by a preceptor.
Collaboration policy: Problem sets should reflect your own work, but you are permitted to work with others.