0
Words
1
Nodes
0
Prefix Matches
Ready
Status
200 ms
Regular node
Search path
End of word
Inserting
Words in Trie
How it works
A Trie (prefix tree) stores strings character by character. Each node represents a prefix, and paths from root to marked nodes spell out stored words.
- Insertion walks down the tree, creating new nodes for each character not yet present.
- Search highlights the path in yellow. Prefix matches update in real time as you type.
- Green-bordered nodes mark the end of a complete word.