1 AVLtree is a small, malloc-based, in-memory index package generally
2 like B-trees and hash tables. The interface resembles that of the BPLUS
3 (B-tree) index package.
5 Index creation options are:
7 - fixed-length binary keys OR variable-length string keys
8 - unique OR duplicate keys
10 standard (void *) pointers for each key OR
11 instance-counting (saves time and memory)
13 Key insert/search time is O(log N). References:
15 Adelson-Velskii, G. M., and E. M. Landis.
16 "An Algorithm for the Organization of Information."
17 Soviet Math. Doclady 3, 1962, pp. 1259-1263.
19 The Art of Computer Programming, Volume 3: Sorting and Searching
20 (2nd printing). Addison-Wesley, 1975, pp. 451-468.
22 AVLtree was written by Gregory Tseytin, tseyting@acm.org.