Drew Martin, School of Computer Science, Carleton
I will be talking about various binary search trees, their theoretical running time and their running time in practical tests.