mainGNU libavl - Summary

 
 
Membership Info
Project Admin:
1 active member

Group identification
Id: #9136
System Name: avl
Name: GNU libavl
Group Type: Official GNU software

Search in this Group

in
   

This project 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

 

Latest News 
GNU libavl 2.0.3 released
     posted by blp, Sun 26 Aug 2007 04:52:34 AM UTC - 0 replies

GNU libavl 2.0.3 may now be downloaded from ftp://ftp.gnu.org/pub/gnu/avl . This version changes libavl's license from GPLv2 to a mix of LGPLv3, GPLv3, and GFDL. It also makes libavl compatible with recent versions of Texinfo and fixes a number of other minor problems.


[Submit News]
[1 news in archive]

Back to the top


Powered by Savane 3.1-cleanup