# Splay Tree Split And Join Sequences: Walkthrough
Splay Tree Split And Join Sequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Splay the k-th node to the root and detach the right child to split; join splays the maximum of the left tree and attaches the right tree.
## 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).
## Common mistake
Joining without splaying the left tree's maximum, leaving a leftover right child.
## 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 try it free.