ccess</p></li>
</ul>
</li>
<li><p>Anytime you find / insert / delete a node, you splay the tree around that node</p></li>
<li><p>Perform tree rotations to make that node the new root node</p></li>
<li><p>Splaying is Œò(h) where h is the height of the tree</p>
<ul>
<li><p>At worst this is linear time - Œò(n)</p></li>
<li><p>We say it runs in Œò(log n) amortized time - individual operations might take linear time, but other operations take almost constant time - averages out to logarithmic time</p>
<ul>