Understand tree structures and string processing. A Trie (pronounced "try"), also called prefix tree, stores strings sharing common prefixes efficiently. Each node represents a character position, and paths from root spell out stored strings.
Each node has up to children (for lowercase English). Know how to implement: insert (create nodes along path), search (follow path and check word end), startsWith (follow path, return true if path exists).