# Link Cut Tree Access Splay: Interview Notes
Link Cut Tree Access Splay shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Represent preferred paths as splay trees of implied keys (depth order) so access(u) splays u, prefers the path to the root, and exposes u as the path root.
## 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) access, link, cut, and path aggregate.
## Common mistake
Splaying inside a path tree without first reversing the preferred-child bits, which leaves the path broken into several preferred pieces.
## 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 interview assistant.