Insert words and watch shared prefixes collapse into a single path.
A trie shares prefixes, so shared letters cost one node between all words.
|-c
| `-a
| |-r*
| `-t*
`-d
`-o
`-g*Searching is a walk down the tree — one edge per character, no comparisons.