BST<br>
Create another container class for storing unordered unique Students.<br>
It should support the methods: Exists, Insert, Traverse, Delete, Retrieve, and Size.<br>
Implement the methods using a Binary Search Tree (BST).<br>
Repeat the previous assignment using your new BST container class.<br>
Compare the Insert, Traverse, Delete, and Retrieve times
to the previous containers.  <br>
Verify that the average ages and the error messages are the same.<br>
After you get it working with the regular lists, try it on the Medium sized lists: FakeNamesMedium.txt, DeleteNamesMedium.txt, and RetrieveNamesMedium.txt.<br>
In this case, do not print every student that failed to insert, delete, or retrieve.  Just print the total fails in each category.<br>