On top-down splaying

DOI10.1007/BF01933728zbMath0642.68119MaRDI QIDQ1101236

Erkki Maekinen

Publication date: 1987

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

rotationamortized complexitybinary search treeself-adjusting data structuressplay tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

Splay trees as priority queues

Cites Work

• Amortized Computational Complexity
• Self-adjusting binary search trees
• A method for constructing binary search trees by making insertions at the root
• Self-Organizing Binary Search Trees

This page was built for publication: On top-down splaying