Remember
- Every access ends by splaying the node to the root. Even a miss splays the last node reached.
- Zig-zig rotates the grandparent first, zig-zag rotates the node twice. That choice halves the path depth.
- No balance information, no worst-case guarantee per access, O(log n) amortized over any sequence.