GNU libavl is a library in ANSI/ISO C for the manipulation of binary trees and balanced binary trees. libavl is written using a literate programming system called TexiWEB. By way of TexiWEB, libavl is as much a textbook on binary trees and balanced binary trees as it is a collection of code.
libavl supports the following kinds of trees:
* Plain binary trees:
o Binary search trees
o AVL trees
o Red-black trees
* Threaded binary trees:
o Threaded binary search trees
o Threaded AVL trees
o Threaded red-black trees
* Right-threaded binary trees:
o Right-threaded binary search trees
o Right-threaded AVL trees
o Right-threaded red-black trees
* Binary trees with parent pointers:
o Binary search trees with parent pointers
o AVL trees with parent pointers
o Red-black trees with parent pointers
Project information
- Licence:
- GNU LGPL v2.1
View full history Series and milestones
trunk series is the current focus of development.
All packages Packages in Distributions
-
libavl source package in Xenial
Version 0.3.5-3 uploaded -
libavl source package in Trusty
Version 0.3.5-3 uploaded -
libavl source package in Precise
Version 0.3.5-3 uploaded -
libavl source package in Oracular
Version 0.3.5-4.1build1 uploaded -
libavl source package in Noble
Version 0.3.5-4.1build1 uploaded
More contributors Top contributors
- Ben Pfaff 26 points
