Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Red-Black trees #16

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Red-Black trees #16

wants to merge 3 commits into from

Conversation

pfcoperez
Copy link
Owner

@pfcoperez pfcoperez commented May 26, 2018 •
edited
Loading

Resolves #15

Description

This PR adds completely transparent RedBlack 🔴 ⚫ trees implementation based on tying-the-not via lazy evaluation and Typelevel's Cats Eval monad.

Please, don't forget to include:

  • Completed implementation.
  • Time complexity bounds.
  • Unit tests / Examples of use
  • Your Twitter handle, LinkedIn profile, ... so you get the credit!

Optionally, you might like to add:

  • Diagrams.
  • Memory complexity bounds.
  • Performance tests.
  • A context on which your contribution might be used.

@pfcoperez pfcoperez self-assigned this May 26, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees

@pfcoperez pfcoperez

Labels
Work In Progress
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@pfcoperez