### Abstract

This work is a formalisation of the Randomised Binary Search Trees introduced by Martínez and Roura, including definitions and correctness proofs.

Like randomised treaps, they are a probabilistic data structure that behaves exactly as if elements were inserted into a non-balancing BST in random order. However, unlike treaps, they only use discrete probability distributions, but their use of randomness is more complicated.

### License

BSD License

### Topics

- Computer science/Data structures
- Computer science/Algorithms/Randomized

### Session Randomised_BSTs

- Randomised_BSTs

### Depends on

- Monad normalisation
- Expected Shape of Random Binary Search Trees

### Auto-related entries

- A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks

## Cite

×

Randomised_BSTs-AFP

    @article{Randomised_BSTs-AFP,
      author  = {Manuel Eberl},
      title   = {Randomised Binary Search Trees},
      journal = {Archive of Formal Proofs},
      month   = {October},
      year    = {2018},
      note    = {\url{https://isa-afp.org/entries/Randomised_BSTs.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Oct 19, 2018 : Isabelle2018