Announce: libavl balanced tree library, version 2.0 ALPHA 2 released

[Ben Pfaff]

The following message is a courtesy copy of an article
that has been posted to comp.lang.c,comp.lang.c.moderated as well.

Version 2.0 ALPHA 2 of the libavl balanced binary tree library is
now available on cscw.msu.edu.  libavl is written in ANSI C.  In
addition to being useful in its own right, version 2.0 is written
as a "literate program", so that it is additionally a
comprehensive introduction to binary trees and balanced trees for
C programmers.

Where to get it:

	Source code as gzip'd tarball (305 kB)
		ftp://cscw.msu.edu/blp/avl-2000.08.03.tar.gz

	Book as PDF (604 kB) or gzip'd PDF (448 kB)
		ftp://cscw.msu.edu/blp/avl-2000.08.03.pdf      
		ftp://cscw.msu.edu/blp/avl-2000.08.03.pdf.gz   

	Book as PostScript (755 kB) or gzip'd PostScript (231 kB)
		ftp://cscw.msu.edu/blp/avl-2000.08.03.ps
		ftp://cscw.msu.edu/blp/avl-2000.08.03.ps.gz

	Book as plain text (264 kB) or gzip'd plain text (68 kB)
		ftp://cscw.msu.edu/blp/avl-2000.08.03.text
		ftp://cscw.msu.edu/blp/avl-2000.08.03.text.gz

Features:

	* ANSI conforming.

	* Fully iterative implementation of all functions.

	* High-quality PostScript figures where available; PNG
          or plain text figures otherwise.

	* Tested source code.

	* Exercises with answers.

	* Glossary.

New in ALPHA 2:

	* References to all the literature I could dig up.

	* Binary search tree and AVL tree chapters now complete.

	* Improved formatting of source code in plain text
          version.

Finally: your comments, corrections, and suggestions are
welcomed!  I am actively continuing to develop and maintain
libavl.  I want it to be a resource for any C programmer
interested in binary tree-based data structures.

Thanks,

Ben.