Comic Strips for Algorithm Visualization
Henning Biermann, Richard Cole
biermann@cs.nyu.edu, cole@cs.nyu.edu
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.
This work was supported in part by NSF grant CCR-9503309.
Download postscript file.
View tree visualization.
Algorithm Visualization Homepage