All releases of GNU libavl

2.0.2

16 Jan 2007 23:11

Release Notes: This release fixes a bug in tavl_delete(). This version (again) works with recent versions of Texinfo, fixes a few typos in the text, and slightly enhances the HTML output format.

2.0.1

24 Aug 2002 22:07

Release Notes: This releases fixes some typos in the text and introduces an HTML output format. No bugs in the libavl code were fixed, because none were reported. Unlike 2.0, this version is compatible with recent releases of Texinfo. dvipdfm is now used for producing the PDF version.

2.0

06 Jan 2002 23:47

Release Notes: This is a complete rewrite of earlier versions. It is not binary or source compatible with libavl 1.x. Compared with 1.x, it includes support for 8 more binary tree variants; compared with the previous development snapshot, 2 more. By way of its literate programming development methodology, it is as much a textbook on binary trees and balanced binary trees as it is a collection of code.

2001.11.10

11 Nov 2001 03:14

Release Notes: Support for right-threaded AVL trees and right-threaded red-black trees was added. Sections covering additional operations on plain binary search trees and red-black trees were added. Discussions of AVL and red-black insertion and deletion was completely rewritten. Numerous other minor improvements throughout the text and code were added.

2001.08.15

15 Aug 2001 14:24

Release Notes: This release adds support for right-threaded binary trees.

2001.08.05

05 Aug 2001 02:24

Release Notes: This release includes a new chapter on threaded red-black trees, a new appendix with a list of algorithms, and extensive revisions and proof-reading throughout.

2001.07.25

25 Jul 2001 17:52

Release Notes: Support for threaded AVL trees.

2001.07.16

17 Jul 2001 10:43

Release Notes: Support for threaded binary search trees was added.

2001.06.28

29 Jun 2001 09:26

Release Notes: This is a major new release, and it is source and binary incompatible with previous releases. It is now written as a literate program using a custom software documentation system called TexiWEB. Memory allocation for trees can be more flexibly controlled, and allocation failure is no longer a fatal error. Traversers are generalized to allow iteration forward and backward in any kind of tree. Traversal can begin anywhere in a tree. Many other new traversal features were added. Unbalanced binary trees are now supported. If they grow too tall, they are automatically fully rebalanced. The tree destruction algorithm was changed to avoid the use of a stack.