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.
|Tags||Software Development Libraries|
|Operating Systems||OS Independent|
Release Notes: New features include range iteration (a longstanding TODO item), Debian packaging, full ANSI C compliance, and a minor code cleanup.
Release Notes: This release adds Cygwin and uninstall support.
Release Notes: Iterators work properly now, static library support has been added, and the Makefile has been cleaned up.
Release Notes: Initial release.