tree — AVL balanced binary trees for C

tree.h is an implementation of AVL (Adelson-Velskii and Landis) balanced trees in the spirit of the BSD queue and list implementations.

Download the source code: tree-1.0.tar.gz
Browse the source code: tree-1.0
Read the manual page: tree.3.html
tree is distributed under the MIT license. It will not infect your project with a contagious disease if you decide to use it.

If you find bugs or have suggestions, please send them to Ian at the domain name of this web site. Thanks!