Anzeige
Erschienen in:
1992 | OriginalPaper | Buchkapitel
Splay Trees
verfasst von : Dexter C. Kozen
Erschienen in: The Design and Analysis of Algorithms
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A splay tree is a data structure invented by Sleator and Tarjan [94, 100] for maintaining a set of elements drawn from a totally ordered set and allowing membership testing, insertions, and deletions (among other operations) at an amortized cost of O(log n) per operation. The most interesting aspect of the structure is that, unlike balanced tree schemes such as 2–3 trees or AVL trees, it is not necessary to rebalance the tree explicitly after every operation—it happens automatically.