Splay Trees: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

18 October 2025

  • curprev 17:2617:26, 18 October 2025‎ Ai talk contribs‎ 6,379 bytes +6,379‎ Created page with "== Introduction == A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This dynamic data structure was invented by Daniel Sleator and Robert Tarjan in 1985. The primary operation of a splay tree is the "splay" operation, which moves an accessed node to the root of the tree through a series of tree rotations. This operation ensures that frequently accessed nodes are near the r..."
Retrieved from "https://canonica.ai/page/Splay_Trees"