Editing Splay tree (section)

== Variants ==

In order to reduce the number of restructuring operations, it is possible to replace the splaying with ''semi-splaying'', in which an element is splayed only halfway towards the root.<ref name="SleatorTarjan"/><ref name=BrinkmannDegraerDeLoof>{{harvnb|Brinkmann|Degraer|De Loof|2009}}.</ref>

Another way to reduce restructuring is to do full splaying, but only in some of the access operations – only when the access path is longer than a threshold, or only in the first ''m'' access operations.<ref name="SleatorTarjan"/>

The CBTree augments the splay tree with access counts at each node and uses them to restructure infrequently. A variant of the CBTree called the LazyCBTree does at most one rotation on each lookup. This is used along with an optimistic hand-over-hand validation scheme to make a concurrent self-adjusting tree.<ref name="AfekEtAl">{{harvnb|Afek|Kaplan|Korenfeld|Morrison|Tarjan|2014}}</ref>

Using pointer-compression techniques,<ref name="BenderEtAl">{{harvnb|Bender|Conway|Farach-Colton|Kuszmaul|Tagliavini|2023}}.</ref> it is possible to construct a [[Succinct data structure|succinct]] splay tree.