need some fast balanced-tree datastructure

Klaus Schilling Klaus.Schilling at
Tue Jun 22 10:05:12 CEST 1999

Pavel Velikho <pvelikho at> writes:

> Hi,
>     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?

There is an avltree implementation in C by Ben Pfaff on the gnu
ftp site . Maybe this can be swigged to python.

Klaus Schilling

More information about the Python-list mailing list