Construct · 1 fields · 1 citations

splay tree: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
splay tree1 CONSTRUCTSplay treeSLEATOR · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a binary search tree that moves each accessed node to the root by rotations, achieving logarithmic amortized cost per operation without stored balance data.

In algorithms and data structures, splay tree refers to a binary search tree that moves each accessed node to the root by rotations, achieving logarithmic amortized cost per operation without stored balance data. This meaning comes from Sleator (1985) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how splay tree sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

dynamic optimality conjecture1 fields · 1 citationsanchor · a standalone constructbalance4 fields · 5 citationsjingle · one word, four constructscost4 fields · 4 citationsjingle · one word, four constructs

References

  1. Sleator, D. D., & Tarjan, R. E. (1985). Self-adjusting binary search trees. Journal of the ACM, 32(3), 652-686. https://doi.org/10.1145/3828.3835

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct