libavl 2.0 ALPHA 2001.06.28 released [ignore]

[Ben Pfaff]

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

libavl 2001.06.28 is now available from 
	http://www.msu.edu/~pfaffben/avl/index.html

This is an ALPHA PRE-RELEASE of libavl version 2.0, a library in
ANSI C for the manipulation of binary trees and balanced binary
trees.  libavl is written using a literate programming system
called TexiWEB.  By way of TexiWEB, libavl is as much a tutorial
on binary trees and balanced binary trees as it is a collection
of code.

The libavl code is written in strict ANSI/ISO C.  Please report
any variations to me as bugs.

I welcome your suggestions and bug reports!

Changes from libavl 2.0 ALPHA 2000.12.13:

  Major new release.  Source and binary incompatible with previous
  releases.

  Improved look for code blocks.

  Memory allocation for trees can be more flexibly controlled.

  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.

Changes from libavl 1.4.1:

  Major new release.  Source and binary incompatible with previous
  releases.

  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.

  Unbalanced binary trees are now supported.  If they grow too tall,
  they are automatically fully rebalanced.

  Tree destruction algorithm changed to avoid use of a stack.

-- 
Ben Pfaff <pfaffben@msu.edu> <pfaffben@debian.org> <blp@gnu.org>
MSU Graduate - Debian GNU/Linux Maintainer - GNU Developer
Personal webpage: http://www.msu.edu/user/pfaffben