On the deque conjecture for the splay algorithm

Abstract

Splay is a simple, efficient algorithm for searching binary search trees, devised by Sleator and Tarjan, that reorganizes the tree after each search by means of rotations. An open conjecture of Sleator and Tarjan states that Splay is, in essence, the fastest algorithm for processing any sequence of search operations on a binary search tree, using only rotations to reorganize the tree. Tarjan proved a basic special case of this conjecture, called the Scanning Theorem, and conjectured a more general special case, called the Deque Conjecture. The Deque Conjecture states that Splay requires linear time to process sequences of deque operations on a binary tree. We prove the following results: 1. Almost tight lower and upper bounds on the maximum numbers of occurrences of various types of right rotations in a sequence of right rotations performed on a binary tree. In particular, the lower bound for right 2-turns refutes Sleator's Right Turn Conjecture. 2. A linear times inverse Ackerman upper bound for the Deque Conjecture. This bound is derived using the above upper bounds. 3. Two new proofs of the Scanning Theorem, one, a simple potential-based proof that solves Tarjan's problem of finding a potential-based proof for the theorem, the other, an inductive proof that generalizes the theorem. © 1992 Akadémiai Kiadó.