Categories

Visit BadVista.org Visit PlayOgg.org Visit DefectiveByDesign.org

GNU avl

libavl is a balanced tree library that comes with full documentation. 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.

Last updated 27 Aug, 2007


User level: Submit a level

User Rating:

Homepage

License(s) :

GPLv3orlater
LGPLv3orlater

Rate it!

 

About

Leadership
  • Ben Pfaff - Maintainer

Versions

2.0.3

2.0.3 stable released 2007-08-26

User Community and Support

User manual available from http://www.stanford.edu/~blp/avl/libavl.html/

General Resources
Support Resources

Development

Developer Resources
Bug Tracking Resources
 

Please send comments on these web pages to bug-directory@fsf.org, send other questions to info@fsf.org.

Copyright © 2000 - 2008 Free Software Foundation, Inc., 51 Franklin Street, 5th Floor, Boston, MA 02110-1301, USA

The copyright licensing notice below applies to this text. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.

Permission is granted to copy, distribute, and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts.