need some fast balanced-tree datastructure

[David Ascher]

On Mon, 21 Jun 1999, Pavel Velikho wrote:

>     I am looking for a fast implementation of incremental container
> that maintains an ordering on the keys... (i.e. I want an AVL,
> Red-Black, or anything similar). I have tried the b+tree in Python but
> its not fast enough. Is there anything like that available as a C
> extension module?

I've used Sam Rushing's AVL module with great success.  It is available
at:

  ftp://squirl.nightmare.com/pub/python/python-ext/avl/

Cheers,

--david ascher