Skip to content

Latest commit

 

History

History
17 lines (15 loc) · 760 Bytes

README.md

File metadata and controls

17 lines (15 loc) · 760 Bytes
Raw

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()