libavl 2.0 ALPHA 2000.12.13 now available

[Ben Pfaff]

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

A new alpha release of libavl 2.0 is now available.  Compared to
the previous 2000.08.31 alpha release, this version adds a number
of refinements and some new material, including the following:

	* Simpler and slightly faster binary tree destruction
          algorithm.

	* When plain BSTs grow too tall, so that a function's
          stack overflows, they are rebalanced automatically and
          the operation resumes.  This rebalance function is also
          exposed to the library user.

	* An alternate recursive implementation of AVL tree
          insertion.

	* Fix to testing code to aid reproducibility.

	* Minor typographical and wording fixes throughout.

The book form of this updated version is available as PDF,
PostScript, and plain text.  Additional versions (Info, DVI,
HTML, etc.) can be generated from the source code tarball.
All of these can be obtained from libavl's webpage, at
	http://www.msu.edu/~pfaffben/avl/index.html
(Scroll down to "Development Versions".)

-- 
Anyone who cannot cope with mathematics is not fully human.  At best he
is a tolerable subhuman who has learned to wear shoes, bathe and not
make messes in the house.
                -- Lazarus Long, "Time Enough for Love"