7: Random Binary Search Trees

Open Data Structures - An Introduction · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    In this chapter, we present a binary search tree structure that uses randomization to achieve \(O(\log \mathtt{n})\) expected time for all operations.

    This page titled 7: Random Binary Search Trees was last modified on Sat, 01 May 2021 15:12:14 GMT and is shared under a CC BY license and was authored, remixed, and/or curated by Pat Morin (Athabasca University Press) .