A simple bound for sequential access in splay trees

This note improves upon an earlier analysis of the author's [2]. Using methods from that paper, we give a dierent proof that the cost of traversing a binary tree by repeated splay-to-root is O(n), a result originally due to Tarjan [5].