# Persistent Implicit Treap Versions: Interview Notes
Persistent Implicit Treap Versions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
On split or merge, copy only the O(log n) dirty nodes and reuse unchanged children so earlier versions stay queryable.
## 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
Expected O(log n) time and extra nodes per update.
## Common mistake
Mutating a shared child in place, which silently changes every older version.
## 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.