http://dbs.mathematik.uni-marburg.de/research/projects/dsn/

Developed in Germany at the University of Marburg, DSN is a project intended to "facilitate the understanding of all kinds of data structures". It might be a good starting point if one wanted an entire data structures course to have visualizations with a similar look and feel. One drawback of the current version is that it cannot yet load and save data structures to disk, and development appears to have ceased.

• Developers: Jens-Peter Dittrich, Jochen van den Bercken, Tobias Schäfer, and Marcus Klein
• Last updated: 2000-07-31
• Last visited: 2005-01-05

Algorithms and Data Structures Implemented

• Trees
  • Binary Search Tree

  • B-Trees (including B+tree and 2-3 tree)

  • AVL Tree

  • Red Black Tree

  • Splay Tree

  • Treap
• Lists and Linear Structures
  • Linked List - sorted and unsorted
  • Doubly Linked List - sorted and unsorted

  • Queues

  • Stack

• Sort Algorithms
  • Bubble Sort (including a "bidirectional" version)
  • Selection Sort
  • Insertion Sort
  • Shell Sort
  • Distribution Sort
  • Heap Sort
  • Merge Sort
  • Quick Sort