Skip to main content

Left-Leaning Red-Black (LLRB) tree.

Project description

Leftrb is a Left-Leaning Red-Black (LLRB) implementation of 2–3 balanced binary search trees in Python. This is a straightforward port of the code presented by Robert Sedgewick in his paper.

README at Github.

Project details


Download files

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

Source Distribution

leftrb-0.1.tar.gz (4.2 kB view details)

Uploaded Source

File details

Details for the file leftrb-0.1.tar.gz.

File metadata

  • Download URL: leftrb-0.1.tar.gz
  • Upload date:
  • Size: 4.2 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for leftrb-0.1.tar.gz
Algorithm Hash digest
SHA256 9dccf5f7099aec8beeba1f6d27996a3b8d7f29dba3d6ed1c879b7b8991f19d92
MD5 e4cd4912d4f9a65bd9c597f7a19bf394
BLAKE2b-256 e602bdb593625a94da936af90e8afd477dd729e158c83207823f0f0610ec5e53

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page