Re: search tree implementations

[Van Snyder]

Rex:

I don't have the modules you're asking for, but I just wanted to say
hello.

You may want to add red-black trees to your list.  They're almost as
good as AVL:  The height is log_sqrt(2) (n), whereas the height of AVL
is log_phi (n), where phi = (1+sqrt(5))/2.  (log_x (n) means log base x of n).

There's a good discussion in the textbook "Algorithms" by Cormen, Leiserson
and Rivest.

Best regards,
Van Snyder