# rbst: Randomized Binary Search Trees

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`

operations. This guarantees logarithmic time operations (with a constant factor) in the worst case.`delete`

[Skip to Readme]

## Downloads

- rbst-0.0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

- No Candidates

Versions [RSS] | 0.0.0.0, 0.0.0.1 |
---|---|

Change log | CHANGELOG.md |

Dependencies | 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), mersenne-random-pure64 (>=0.2.2.0 && <0.3), text (>=1.2.3.0 && <2.0.0.0), transformers (>=0.5.0.0 && <0.6.0.0) [details] |

License | MIT |

Copyright | 2020 Arnau Abella |

Author | Arnau Abella |

Maintainer | arnauabella@gmail.com |

Category | Data Structures |

Home page | https://github.com/monadplus/rbst |

Bug tracker | https://github.com/monadplus/rbst/issues |

Source repo | head: git clone https://github.com/monadplus/rbst.git |

Uploaded | by ArnauAbella at 2020-05-09T18:00:31Z |

Distributions | |

Downloads | 345 total (3 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2020-05-09 [all 1 reports] |