Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Algorithms and Their Complexity Read chapter Read first chapter

1992 | OriginalPaper | Chapter

Random Search Trees

Author : Dexter C. Kozen

Published in: The Design and Analysis of Algorithms

Publisher: Springer New York

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

In this lecture we will describe a very simple probabilistic data structure that allows inserts, deletes, and membership tests (among other operations) in expected logarithmic time.

previous chapter Splay Trees
next chapter Planar and Plane Graphs
Metadata
Title
Random Search Trees
Author
Dexter C. Kozen
Copyright Year
1992
Publisher
Springer New York
Book
The Design and Analysis of Algorithms

Print ISBN: 978-1-4612-8757-5

Electronic ISBN: 978-1-4612-4400-4

Copyright Year: 1992

DOI
https://doi.org/10.1007/978-1-4612-4400-4_13

Premium Partner

    Image Credits