free society. We build this foundation.
With your help, we will raise $450,000 this
winter to make this foundation even stronger.
Donate today, and build us up for 2014.
libavl is a balanced tree library that comes with full documentation. It includes unthreaded, right threaded, and fully threaded variants of AVL tree, as well as unthreaded red-black trees. It features self-test routines as well as insertion, deletion, tree count, tree copy, tree walking and traversal, search, and threading and unthreading routines. Each function has a comment describing its interface, and each step in the algoritms the program uses has a comment also. Each source code file includes a built-in test routine.
DocumentationUser manual available from http://www.stanford.edu/~blp/avl/libavl.html/
released on 26 August 2007
|License||Verified by||Verified on||Notes|
|GPLv3orlater||Deborah Nicholson||7 January 2008|
|LGPLv3orlater||Deborah Nicholson||7 January 2008|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 27 August 2007.