7. Random Binary Search Trees

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



Subsections

opendatastructures.org