Skip to content
An extremely well tested and commented red black tree implementation. Worth a look if you are studying the material.
Python Ruby
Branch: master
Clone or download
stanislavkozlovski Merge pull request #2 from Enether/issues/#1
[Issues/#1] Fix `floor()` method to correctly return None when a value smaller than the tree's max value is given
Latest commit cb3cefb May 7, 2018

README.md

Red-Black-Tree

An extremely well tested and commented classic red black tree implementation. Worth a look if you are studying the material. Supports

  • addition
  • deletion

Currently implemented in Python and Ruby

These implementations can be found in my data structures repository. The reason I created a separate repository for the tree is to enable people to find this easily. I personally searched a lot through GitHub while learning about RB trees and did not manage to find code that was well commented and well tested. I've tried to heavily describe each rotation and with 2000 lines of tests, I think it's descriptive enough

Note

Does not support duplicate values

TODOs

  • Rewrite tests for Ruby
  • Write extra methods, like ceiling() and floor()
You can’t perform that action at this time.