The items in the collections are always changing - in fact you have, on average, one new item and one deletion for every 10 searches. The testing of this class should include measurement of the black height of the tree as randomly valued key items are added. It should also time searches and additions to measure the time complexity of the add and find operations. These should confirm the theoretical expectations. Submission For full marks, each member of the class should be responsible for one implementation and one test exercise.
Assignments are compulsory and failure to submit one is the same as failing the course.
Thus a late assignment may not get you any marks, but it will allow you to sit the exam. Basically you should use the same submission procedure as before.