This paper presents visualizations of binary search trees and splay trees.
The visualizations comprise sequences of figures or frames, called comic
strips. Consecutive frames are viewed two at a time to facilitate user
(viewer) understanding of the algorithm steps. The visualizations are
implemented in Java to facilitate their wide use. This paper explores
several other considerations in the design of instructional
visualizations.