avl-tree
AVL (Adelson-Velsky-Landis) Tree is a self-balancing binary search tree implementation in Common Lisp. See README file for details.

ASDF-install package (obsolete) http://www.students.itu.edu.tr/~yazicivo/files/avl-tree.tar.gz (Tarball comes with the latest .git source tree. Feel free to play with it.)


data structure