Libraries for the manipulation of binary trees and balanced binary trees.
libavl is a collection of computer subroutines for constructing and manipulating binary trees and balanced trees.
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.
1 March 2022
- Applies to part: libraries
1 March 2022
- Applies to part: programs
Leaders and contributors
Resources and communication
|VCS Repository Webview||https://git.savannah.gnu.org/cgit/avl.git/|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.