# Eertree Online Palindrome Insertion: Study Guide
Eertree Online Palindrome Insertion shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each node is a unique palindrome; adding a character walks suffix links until the preceding character matches, then adds a new node or follows an existing edge.
## 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
O(n) nodes and O(n) time with a constant alphabet.
## Common mistake
Forgetting the even and odd empty-root nodes, so the first characters have nowhere to attach.
## 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.