Balanced binary tree implementation

[M.-A. Lemburg]

Lucas P Melo wrote:
> Hello,
> 
> I would like to use a balanced binary tree implementation (preferably
> within some API).
> Any hints about where I could find it?
> 
> I am looking for something that implements insertion, deletion, search
> and a special search that returns the lesser element bigger than a given
> key [1].
> 
> A nice possibility would be an extensible API that allows me to inherit
> its classes and to add operations myself.
> 
> Thanks in advance.
> 
> [1] Ex: 1 2 3 4 5 6 are elements of the bbt. If I use this operation
> given 4 as the parameter, the value returned would be 5.

You might want to have a look at the btree implementation we
have in mxBeeBase:

    http://www.egenix.com/products/python/mxBase/mxBeeBase/

It's written in C and optimized for on-disk operations.

-- 
Marc-Andre Lemburg
eGenix.com

Professional Python Services directly from the Source  (#1, Jul 23 2009)
>>> Python/Zope Consulting and Support ...        http://www.egenix.com/
>>> mxODBC.Zope.Database.Adapter ...             http://zope.egenix.com/
>>> mxODBC, mxDateTime, mxTextTools ...        http://python.egenix.com/
________________________________________________________________________

::: Try our new mxODBC.Connect Python Database Interface for free ! ::::


   eGenix.com Software, Skills and Services GmbH  Pastor-Loeh-Str.48
    D-40764 Langenfeld, Germany. CEO Dipl.-Math. Marc-Andre Lemburg
           Registered at Amtsgericht Duesseldorf: HRB 46611
               http://www.egenix.com/company/contact/