AVL-Tree classes for Delphi.

(c) 4 Jan 2001  Alex Konshin <alexk@mtgroup.ru>


Excuse my english. 


AVLtrees unit implement fast insertion, replacing, deletion and search of item 
(complexity is O*log(N)). 
It contains low level functions, low level class and user-friendly classes. 
Most of functions are implemented on BASM (inline assembler). 

See Dr.D.E.Knuth "Art of Computer Programming" for more information about 
balanced trees. 
For implementation of item deletion I use an article "An Iterative Algorithm 
for Deletion from AVL-Balanced Binary Trees" by Ben Pfaff, 
http://www.msu.edu/user/pfaffben/avl 

Latest version of AVLtrees unit (with sources) is available on my homepage 
http://www.mtgroup.ru/~alexk/ 
