On top-down splaying (Q1101236)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4047147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On top-down splaying |
scientific article; zbMATH DE number 4047147 |
Statements
On top-down splaying (English)
0 references
1987
0 references
The splay tree is a self-adjusting binary search tree which has a good amortized performance. This paper studies some properties of top-down splay trees. Different ways to charge for the primitive operations of top-down splaying are discussed. We also give some empirical results concerning the behaviour of different top-down restructuring algorithms.
0 references
rotation
0 references
self-adjusting data structures
0 references
amortized complexity
0 references
splay tree
0 references
binary search tree
0 references
0.8754167556762695
0 references
0.8252329230308533
0 references
0.82451331615448
0 references
0.8241215944290161
0 references
