Skip to main content
Engineering LibreTexts

7: Random Binary Search Trees

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

    • Was this article helpful?