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

Depends on: demacs

Repository: https://github.com/vy/avl-tree

License: BSD 2-Clause


data structure