Implementing and comparing various types of binary search trees (such as splay trees, AVL trees, etc.) using the OPSIS visual programming system for data structures.  Students selecting this option will not need to write a large program in C, C++ or any other traditional language but will do most of their work with a powerful, new visual editor for data structure algorithms. Here is <a href="http://www.cs.washington.edu/homes/amir/Opsis.html"> more information on OPSIS.</a> <li>
