On top-down splaying (Q1101236)

From MaRDI portal
Revision as of 15:53, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On top-down splaying
scientific article

    Statements

    On top-down splaying (English)
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references