@hackage rbst0.0.0.1

Randomized Binary Search Trees

Categories
- Data Structures
License
MIT
Maintainer
arnauabella@gmail.com
Links
Versions
- 0.0.0.1 Sat, 9 May 2020
- 0.0.0.0 Sat, 9 May 2020

Installation
In your cabal file:
Tested Compilers
- 8.8.3
Dependencies (7)
- base >=4.12 && <4.15
- bytestring >=0.10.8.2 && <0.11.0.0
- containers >=0.5.0.1 && <0.7
- deepseq >=1.4 && <1.5
- text >=1.2.3.0 && <2.0.0.0
- transformers >=0.5.0.0 && <0.6.0.0
Dependents (0)

This package contains an implementation of a Randomized Binary Search Tree.

Randomized Binary Search Trees are guaranteed to be Random BST irrespective of the number of insert / delete operations. This guarantees logarithmic time operations (with a constant factor) in the worst case.

@hackage rbst0.0.0.1

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (7)

Dependents (0)