GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere. The project supports these kinds of trees:
Plain binary trees:
· Binary search trees
· AVL trees
· Red-black trees
Threaded binary trees:
· Threaded binary search trees
· Threaded AVL trees
· Threaded red-black trees
Right-threaded binary trees:
· Right-threaded binary search trees
· Right-threaded AVL trees
· Right-threaded red-black trees
Binary trees with parent pointers:
· Binary search trees with parent pointers
· AVL trees with parent pointers
· Red-black trees with parent pointers
What's New in This Release:
· This release fixes a bug in tavl_delete().
· This version (again) works with recent versions of Texinfo, fixes a few typos in the text, and slightly enhances the HTML output format.
Product's homepage
Find us on Google+
