A Refined Analysis of the Sequential Access Theorem for Splay Trees

2026-09-17

AI Summary

本文通过改进分析方法和引入新的势函数，证明了伸展树顺序访问定理中的常数上界为5.5，并给出下界近4的实例。

Abstract

A splay tree is a self-adjusting binary search tree that allows access, insertion, and deletion to be performed in amortized $O(\log n)$ time, where $n$ is the number of stored elements.The sequential access theorem states that, when the elements of a splay tree are accessed in increasing order, the amortized cost per operation becomes a constant. In this paper, we show that the upper bound for this constant is at most $5.5$ by refining the existing analysis and introducing a new potential function. Furthermore, we complement our result by showing that there exists a splay tree for which the constant is lower-bounded by almost $4$.

Problem

• splay tree
• sequential access theorem
• amortized cost

Innovation

• splay tree
• sequential access theorem
• amortized cost
• potential function