# Palindromic Tree Eertree Nodes: Walkthrough

Palindromic Tree Eertree Nodes 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; suffix links jump to the longest palindromic suffix and odd/even roots seed even and odd lengths.

## 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 edges on an alphabet-sized transition map.

## Common mistake

Linking to a suffix that is not itself a palindrome, which breaks the tree invariant.

## 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 the Linkjob AI app.