blob: dcc1a17a189c8a62d0aaa5b64e4efa46d8440377 (
plain) (
blame)
1
2
3
4
5
|
A trie is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In
addition to implementing the mapping interface, tries allow finding the
items for a given prefix, and vice versa, finding the items whose keys
are prefixes of a given key.
|