| Points |
Task |
| 1 |
Implements a balanced tree |
| 1 |
Can insert |
| 1 |
Can delete |
| 1 |
Can search |
| 3 |
Uses the AVL algorithm |
| 1 |
Is templated |
| 1 |
Uses += and -= for insert and
delete |
| 1 |
Uses << for printing |
| 1 |
Uses = for deep copy assignment |
| -1 |
Failure to have a destructor |
| -1 |
Per day AFTER mon Feb 23 |
| 10,000 |
Mentions Buffy the Vampire Slayer |