Skip to main content
Join the official 2019 Python Developers SurveyStart the survey!

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.

Project details

Download files

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

Files for red-black-tree-mod, version 1.20
Filename, size File type Python version Upload date Hashes
Filename, size red-black-tree-mod-1.20.tar.gz (28.6 kB) File type Source Python version None Upload date Hashes View hashes

Supported by

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