AVL C Library

This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys. The AVL tree is an explicit binary searching tree, where left children of each vertex are less or equal, while right children are greater or equal than the vertex itself. In addition, the tree is balanced so that the difference between the depths of the two subtrees of each vertex is at most one.

• Release tags
• All releases

Recent releases

• 
• 0.4

• 
•  13 Feb 2002 11:23
• 

• Minor feature enhancements

Release Notes: New features include range iteration (a longstanding TODO item), Debian packaging, full ANSI C compliance, and a minor code cleanup.

• 
• 0.3

• 
•  12 Feb 2002 17:18
• 

• Minor feature enhancements

Release Notes: This release adds Cygwin and uninstall support.

• 
• 0.2

• 
•  09 Apr 2001 14:23
• 

• Minor bugfixes

Release Notes: Iterators work properly now, static library support has been added, and the Makefile has been cleaned up.

• 
• 0.1

• 
•  30 Jan 2001 06:12
• 

Release Notes: Initial release.

• All comments

Recent comments

08 Sep 2005 08:27 tano

Searching?

Nice, handy library.

How do you search for a node? The search function appears to return only integers:

int avl_search(avl_tree* t, avl* a,int(*iter)(avl* a));

fotang