Splay tree

From Wikipedia, the free encyclopedia

A splay tree is a self-balancing binary search tree with the additional unusual property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log(n)) amortized time. For many non-uniform sequences of operations, splay trees perform better than other search trees, even when the specific pattern of the sequence is unknown. The splay tree was invented by Daniel Sleator and Robert Tarjan.

All normal operations on a binary search tree are combined with one basic operation, called splaying. Splaying the tree for a certain element rearranges the tree so that the element is placed at the root of the tree. One way to do this is to first perform a standard binary tree search for the element in question, and then use tree rotations in a specific fashion to bring the element to the top. Alternatively, a bottom-up algorithm can combine the search and the tree reorganization.

1 Advantages and disadvantages
2 The splay operation
3 Performance theorems
4 Dynamic optimality conjecture
5 See also
6 References
7 External links

[edit] Advantages and disadvantages

Good performance for a splay tree depends on the fact that it is self-balancing, and indeed self optimising, in that frequently accessed nodes will move nearer to the root where they can be accessed more quickly. This is an advantage for nearly all practical applications, and is particularly useful for implementing caches; however it is important to note that for uniform access, a splay tree's performance will be considerably (although not asymptotically) worse than a somewhat balanced simple binary search tree.

Splay trees also have the advantage of being considerably simpler to implement than other self-balancing binary search trees, such as red-black trees or AVL trees, while their average-case performance is just as efficient. Also, splay trees don't need to store any bookkeeping data, thus minimizing memory requirements. However, these other data structures provide worst-case time guarantees, and can be more efficient in practice for uniform access.

One worst case issue with the basic splay tree algorithm is that of sequentially accessing all the elements of the tree in the sort order. This leaves the tree completely unbalanced (this takes n accesses- each an O(1) operation). Reaccessing the first item triggers an operation that takes O(n) operations to rebalance the tree before returning the first item. This is a significant delay for that final operation, although the amortised performance over the entire sequence is actually O(1). However, recent research shows that randomly rebalancing the tree can avoid this unbalancing effect and give similar performance to the other self-balancing algorithms.

It is possible to create a persistent version of splay trees which allows access to both the previous and new versions after an update. This requires amortized O(log n) space per update.

Contrarily to other types of self balancing trees, splay trees work well with nodes containing identical keys. Even with identical keys, performance remains amortized O(log n). All tree operations preserve the order of the identical nodes within the tree, which is a property similar to stable sorting algorithms. A carefully designed find operation can return the left most or right most node of a given key.

[edit] The splay operation

When a node x is accessed, a splay operation is performed on x to move it to the root. To perform a splay operation we carry out a sequence of splay steps, each of which moves x closer to the root. As long as x has a grandparent, each particular step depends on two factors:

Whether x is the left or right child of its parent node, p,
Whether p is the left or right child of its parent, g (the grandparent of x).

Thus, there are four cases when x has a grandparent. They fall into two types of splay steps.

Zig-zag Step: One zig-zag case is when x is the right child of p and p is the left child of g (shown above). p is the new left child of x, g is the new right child of x, and the subtrees A, B, C, and D of x, p, and g are rearranged as necessary. The other zig-zag case is the mirror image of this, i.e. when x is the left child of p and p is the right child of g. Note that a zig-zag step is equivalent to doing a rotation on the edge between x and p, then doing a rotation on the edge between x and g.

Zig-zig Step: One zig-zig case is when x is the left child of p and p is the left child of g (shown above). p is the new right child of x, g is the new right child of p, and the subtrees A, B, C, and D of x, p, and g are rearranged as necessary. The other zig-zig case is the mirror image of this, i.e. when x is the right child of p and p is the right child of g. Note that zig-zig steps are the only thing that differentiate splay trees from the rotate to root method indroduced by Allen and Munro prior to the introduction of splay trees.

Zig Step: There is also a third kind of splay step that is done when x has a parent p but no grandparent. This is called a zig step and is simply a rotation on the edge between x and p. Zig steps exist to deal with the parity issue and will be done only as the last step in a splay operation and only when x has odd depth at the beginning of the operation.

By performing a splay operation on the node of interest after every access, we keep recently accessed nodes near the root and keep the tree roughly balanced, so that we achieve the desired amortized time bounds.

[edit] Performance theorems

There are several theorems and conjectures regarding the worst-case runtime for performing a sequence S of m accesses in a splay tree containing n elements.

Balance Theorem:^[1] The cost of performing the sequence S is $O (m (log n + 1) + n log n)$ . In other words, splay trees perform as well as static balanced binary search trees on sequences of at least n accesses.

Static Optimality Theorem:^[1] Let $q i$ be the number of times element i is accessed in S. The cost of performing S is $O\left(m+\sum_{i=1}^n q_i\log\frac{m}{q_i}\right)$ . In other words, splay trees perform as well as optimum static binary search trees on sequences of at least n accesses.

Static Finger Theorem:^[1] Let $i j$ be the element accessed in the $j t h$ access of S and let f be any fixed element (the finger). The cost of performing S is $O\left(m+n\log n+\sum_{j=1}^m \log(|i_j-f|+1) \right)$ .

Working Set Theorem:^[1] Let $t (j)$ be the number of distinct elements accessed between access j and the previous time element $i j$ was accessed. The cost of performing S is $O\left(m+n\log n+\sum_{j=1}^m \log(t(j)+1) \right)$ .

Dynamic Finger Theorem:^[2]^[3] The cost of performing S is $O\left(m+n\log n+\sum_{j=1}^m \log(|i_{j+1}-i_j|+1) \right)$ .

Scanning Theorem:^[4] Also known as the Sequential Access Theorem. Accessing the n elements of a splay tree in symmetric order takes $Θ(n)$ time, regardless of the initial structure of the splay tree. The tightest upper bound proven so far is $4.5 n$ .^[5]

[edit] Dynamic optimality conjecture

In addition to the proven performance guarantees for splay trees there is an unproven conjecture of great interest from the original Sleator and Tarjan paper. This conjecture is known as the dynamic optimality conjecture and it basically claims that splay trees perform as well as any other binary search tree algorithm up to a constant factor.

Dynamic Optimality Conjecture:^[1] Let

A

be any binary search tree algorithm that accesses an element

x

by traversing the path from the root to

x

at a cost of

d (x) + 1

, and that between accesses can make any rotations in the tree at a cost of 1 per rotation. Let

A (S)

be the cost for

A

to perform the sequence

S

of accesses. Then the cost for a splay tree to perform the same accesses is

O (n + A (S))

There is a special case of the dynamic optimality conjecture known as the traversal conjecture that is also unproven.

Traversal Conjecture:^[1] Let

T 1

and

T 2

be two splay trees containing the same elements. Let

S

be the sequence obtained by visiting the elements in

T 2

in preorder (i.e. depth first search order). The total cost of performing the sequence

S

of acesses on

T 1

O (n)

[edit] See also

Scapegoat tree
Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89685-0. Page 478 of section 6.2.3.

[edit] References

^ ^a ^b ^c ^d ^e ^f D.D. Sleator and R.E. Tarjan. Self-Adjusting Binary Search Trees. Journal of the ACM 32:3, pages 652-686, 1985.
^ R. Cole, B. Mishra, J. Schmidt, A. Siegel. On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM Journal on Computing 30, pages 1-43, 2000.
^ R. Cole. On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof. SIAM Journal on Computing 30, pages 44-85, 2000.
^ R.E. Tarjan. Sequential access in splay trees takes linear time. Combinatorica 5, pages 367-378, 1985.
^ Amr Elmasry. On the sequential access theorem and deque conjecture for splay trees. Theor. Comput. Sci. 314(3), pages 459-466, 2004.