7 PM – Coding Olympic Training

Homework:

1. Write the minimal stops problem and binary search tree by yourself and understand how to solve problems with queue and binary search tree
2. http://www.usaco.org/index.php?page=feb22results, review all three bronze problems and we will work on it together next week.