# 26.3. The Splay Tree¶

Like the AVL tree, the splay tree is not actually a distinct data structure, but rather reimplements the BST insert, delete, and search methods to improve the performance of a BST. The goal of these revised methods is to provide guarantees on the time required by a series of operations, thereby avoiding the worst-case linear time behavior of standard BST operations. No single operation in the splay tree is guaranteed to be efficient. Instead, the splay tree access rules guarantee that a series of \(m\) operations will take \(O(m log n)\) time for a tree of \(n\) nodes whenever \(m \geq n\). Thus, a single insert or search operation could take \(O(n)\) time. However, \(m\) such operations are guaranteed to require a total of \(O(m \log n)\) time, for an average cost of \(O(\log n)\) per access operation. This is a desirable performance guarantee for any search-tree structure.

Unlike the AVL tree, the splay tree is not guaranteed to be height balanced. What is guaranteed is that the total cost of the entire series of accesses will be cheap. Ultimately, it is the cost of the series of operations that matters, not whether the tree is balanced. Maintaining balance is really done only for the sake of reaching this time efficiency goal.

The splay tree access functions operate in a manner reminiscent of
the *move-to-front* rule for
*self-organizing lists*,
and of the path compression technique for managing
a series of
*Union/Find* operations.
These access functions tend to make the tree more balanced, but an
individual access will not necessarily result in a more balanced
tree.

Whenever a node \(S\) is accessed (e.g., when \(S\) is
inserted, deleted, or is the goal of a search), the splay tree
performs a process called *splaying*.
Splaying moves \(S\) to the root of the BST.
When \(S\) is being deleted, splaying
moves the parent of \(S\) to the root.
As in the AVL tree, a splay of node \(S\)
consists of a series of *rotations*.
A rotation moves \(S\) higher in the tree by adjusting its
position with respect to its parent and grandparent.
A side effect of the rotations is a tendency to balance the tree.
There are three types of rotation.

A *single rotation* is performed only if \(S\)
is a child of the root node.
The single rotation is illustrated by Figure 26.3.1.
It basically switches \(S\) with its parent in a way that
retains the BST property.
While Figure 26.3.1 is slightly different from
Figure 26.2.2, in fact the splay tree single
rotation is identical to the AVL tree single rotation.

Unlike the AVL tree, the splay tree requires two types of double rotation. Double rotations involve \(S\), its parent (call it \(P\)), and \(S\) 's grandparent (call it \(G\)). The effect of a double rotation is to move \(S\) up two levels in the tree.

The first double rotation is called a \(zigzag rotation\). It takes place when either of the following two conditions are met:

- \(S\) is the left child of \(P\), and \(P\) is the right child of \(G\).
- \(S\) is the right child of \(P\), and \(P\) is the left child of \(G\).

In other words, a zigzag rotation is used when \(G\), \(P\), and \(S\) form a zigzag. The zigzag rotation is illustrated by Figure 26.3.2.

The other double rotation is known as a *zigzig* rotation.
A zigzig rotation takes place when either of the following two
conditions are met:

- \(S\) is the left child of \(P\), which is in turn the left child of \(G\).
- \(S\) is the right child of \(P\), which is in turn the right child of \(G\).

Thus, a zigzig rotation takes place in those situations where a zigzag rotation is not appropriate. The zigzig rotation is illustrated by Figure 26.3.3. While Figure 26.3.3 appears somewhat different from Figure 26.2.3, in fact the zigzig rotation is identical to the AVL tree double rotation.

Note that zigzag rotations tend to make the tree more balanced, because they bring subtrees \(B\) and \(C\) up one level while moving subtree \(D\) down one level. The result is often a reduction of the tree's height by one. Zigzig promotions and single rotations do not typically reduce the height of the tree; they merely bring the newly accessed record toward the root.

Splaying node \(S\) involves a series of double rotations until \(S\) reaches either the root or the child of the root. Then, if necessary, a single rotation makes \(S\) the root. This process tends to re-balance the tree. Regardless of balance, splaying will make frequently accessed nodes stay near the top of the tree, resulting in reduced access cost. Proof that the splay tree meets the guarantee of \(O(m \log n)\) is beyond the scope of our study.

Example 26.3.1

Consider a search for value 89 in the splay tree of Figure 26.3.4 (a). The splay tree's search operation is identical to searching in a BST. However, once the value has been found, it is splayed to the root. Three rotations are required in this example. The first is a zigzig rotation, whose result is shown in Figure 26.3.4 (b). The second is a zigzag rotation, whose result is shown in Figure 26.3.4 (c). The final step is a single rotation resulting in the tree of Figure 26.3.4 (d). Notice that the splaying process has made the tree shallower.