1This is version 1.4 of libavl, a library in ANSI C for manipulation of 2balanced binary trees. Functions for use with three varieties of AVL 3tree and one type of red-black tree are included. There is full 4documentation, including an explanation of what AVL and red-black 5trees are and why you'd use them, in Texinfo, Info, HTML, and plain 6text formats. 7 8The library is divided into three parts, described in more detail 9below. You need only include the files for the types of trees that 10you are using. 11 12 - avl.h, avl.c: Unthreaded AVL tree library. 13 - avlt.h, avlt.c: Threaded AVL tree library. 14 - avltr.h, avltr.c: Right-threaded AVL tree library. 15 - rb.h, rb.c: Unthreaded red-black tree library. 16 17Each .c file in the library has a self-test routine built in, which 18can be invoked by compiling it with SELF_TEST set to 1. In addition, 19there is a separate program thread-test.c that tests the functions 20that convert among types of AVL trees. To automatically run these 21tests, type `make check' after you have configured the library with 22`configure'. For more information on how to configure and compile 23libavl, see the file INSTALL included in this directory. 24 25libavl is licensed under the GNU General Public License (GPL), which 26should be included in this directory in file COPYING. This is not the 27same as GNU Library General Public License (LGPL). Please read the 28license and become familiar with its terms. 29 30Please send bug reports and enhancement requests for libavl to Ben 31Pfaff <blp@gnu.org>. 32 33Share and enjoy! 34 35Local variables: 36mode: text 37End: 38