This document is still very preliminary. It is likely to be incomplete and/or incorrect and is very likely to change.
libavl is an implementation of AVL trees, a particular flavour of self-balancing binary search tree.
At this writing, 2025-11-13, the only machines I know it works on are my own. Its native home is NetBSD, but I expect it to be an easy-to-trivial port to make it work on anything mostly UNIXy.
Its manpage source (as of the tip of HEAD) is available in my unpacked-git-repos space here.
My primary distribution mechanism is a world-clonable git repo: git://git.rodents-montreal.org/libavl is the thing to clone. There's also the unpacked view of the git repo; see here.
Almost all these pages—all, I think—are 100% hand-coded.