• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Abstract:

In this lecture, we describe splay trees, a data structure developed by Sleator and Tarjan [1] which supports insert, delete, nd, split, and merge operations in logarithmic amortized time. We show this with a general result that can also be used to prove that the performance of splay trees is within a constant factor of optimal in a number of dierent paradigms. Splay trees are binary trees. The basic building block for all of their operations is the rotation. A right rotation is depicted in Figure 1.1; a left rotation is the reverse, moving from the conguration shown in the right side of the gure to the conguration on the left. y x

Citations