GNU libavl - Summary

This software is part of the GNU Project.

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:
  • 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

Registration Date: Sat 24 Feb 2007 10:03:42 PM UTC
License: GNU Lesser General Public License
Development Status: 5 - Production/Stable