Skip to main content
Help us improve Python packaging – donate today!

Flexible python implementation of red black trees

Project Description

A pair of python modules implementing red black trees is provided.

Red-black trees are a little slower than treaps (some question this), but they give a nice low standard deviation in operation times, and this code is rather flexible.

A module is provided for red black trees that enforce uniqueness. They allow for set-like use and dictionary-like use.

This code is known to work on CPython 2.x, CPython 3.x, Pypy and Jython.

Much of the work here was done by Duncan G. Smith. Dan just put some finishing touches on it.

Release history Release notifications

This version
History Node

1.20

History Node

1.11

History Node

1.10

History Node

1.06

History Node

1.05

History Node

1.01

History Node

1.0

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size & hash SHA256 hash help File type Python version Upload date
red-black-tree-mod-1.20.tar.gz (28.6 kB) Copy SHA256 hash SHA256 Source None Nov 4, 2013

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page