How to implement Splay (K,T)?
First search for K in usual way, remembering search path by stacking it. Let P be last node inspected. (If K is in tree, K is in node P, otherwise, P has empty child where search for K terminated)
Idea 1: perform single rotations bottom up -- return along path from P to root carrying out rotations that move P up the tree, so that when splay is completed, P will be the new root.