# Sleator Tarjan Splay Amortized: Study Guide

Sleator Tarjan Splay Amortized shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Rotate the accessed node all the way to the root with zig-zig and zig-zag pairs so frequently used keys migrate up and the amortized cost of a sequence is logarithmic.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

Amortized O(log n) per access by the access lemma.

## Common mistake

Doing only single rotations (never zig-zig) so the tree can degenerate into a spine and lose the balance guarantee.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.