43
Tries
(cont)
A
trie
…
is a tree-like data structure
for compact representation of a set of strings
e.g. all the words in a text, a dictionary etc.
Note: Trie comes from
re
trie
val
, but is pronounced like "try" to distinguish it from "tree"