 This also makes them unsuitable for general use in purely functional programming, although even there they can be used in limited ways to implement priority queues.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.