For an arbitrary spay tree with
n nodes, if we perform
n find operations, is there a way of generalizing what the tree would look like after
n operations and proving it mathematically?
One such example (Sequential Access Theorem): if the splay tree has the elements
V1, V2,..., Vn, where
V1 ≤ V2 ≤ ... ≤ Vn. And the find operations are in the order:
V1, V2,..., Vn.