Hacker GitHub

← All repos

peterhil/leftrb

View on GitHub ↗ ★ 20 Python

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

4 mentions on Hacker News by 2 people: 1 story, 3 comments · first 2013-01-22 · latest 2015-04-06

Mentions per year 4 mentions · busiest year 2013 (2)
20082026
AllStoriesComments NewestTopOldest
  1. Here is a Python port I wrote based on the linked paper: https://github.com/peterhil/leftrb (I haven't used it much, so there might be bugs...)
    comment by peterhil · 2015-04-06 · in Left-leaning Red-Black Trees (2008) [pdf]
  2. After reading the following implementation in python, I must agree: https://github.com/peterhil/leftrb/blob/master/leftrb/llrb.p...
    comment by Cieplak · 2014-12-01 · in Left-leaning red-black trees are hard to implement (2008)
  3. Added the deletion methods and simple tests: http://pypi.python.org/pypi/leftrb/0.1.1 https://github.com/peterhil/leftrb/tree/v0.1.1
    comment by peterhil · 2013-01-24 · in Sedgewick's Left-Leaning Red-Black tree in Python
  4. ▲ 4
    Sedgewick's Left-Leaning Red-Black tree in Python
    story by peterhil · 2013-01-22 · 2 comments