5 lines
229 B
Plaintext
5 lines
229 B
Plaintext
A trie is a tree-like data structure whose nodes store the letters of an
|
|
alphabet. By structuring the nodes in a particular way, words and strings
|
|
can be retrieved from the structure by traversing down a branch path of
|
|
the tree.
|