Tidy animations of tree algorithms

In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. The authors describe methods for animating three manipulation algorithms, one of the most challenging algorithm animation domains. In particular, they animate operations on pairing heap data structures which are used to implement priority queues. Their animations use tree layout heuristics and smooth transitions for illustrating intermediate algorithm states to promote viewer understanding.<
>