Comic Strips for Algorithm Visualization

Henning Biermann, Richard Cole
Courant Institute of Mathematical Sciences
New York University
February, 1999


This paper presents visualizations of binary search trees and splay trees. The visualization 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 grants CCR-9503309 and CCR-9800085.

Selected References:

Download postscript file.

View tree visualization.

Algorithm Visualization Homepage

Henning Biermann,
Revised: February 10, 1999