treap VS red-black-tree

Compare treap vs red-black-tree and see what are their differences.

treap

:leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure (by chshersh)

red-black-tree

Red Black Trees implemented in Haskell (by GAumala)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Zigi - Delete the most useless function ever: context switching.
  • Scout APM - Truly a developer’s best friend
  • InfluxDB - Build time-series-based applications quickly and at scale.
treap red-black-tree
0 0
64 5
- -
0.5 0.0
over 1 year ago over 1 year ago
Haskell Haskell
Mozilla Public License 2.0 BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

treap

Posts with mentions or reviews of treap. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.

red-black-tree

Posts with mentions or reviews of red-black-tree. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning red-black-tree yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing treap and red-black-tree you can also consider the following projects:

IntervalMap - Haskell interval collections

IntGraph - Dynamically sized graphs

immutable-js - Immutable persistent data collections for Javascript which increase efficiency and simplicity.

idx - maps, sets and vectors with on-demand secondary indexes.

Immer - Create the next immutable state by mutating the current one

fibonacci - 🔢 Fibonacci Utilities

fibonacci - Fast computation of Fibonacci numbers in Haskell