Crate trie 

Trie (prefix tree) for storing and querying strings.

Supports three operations, each O(L) where L is the length of the input:

• Trie::insert - add a word to the trie
• Trie::search - whether a word was previously inserted
• Trie::starts_with - whether any inserted word has the given prefix

Children are stored in a HashMap<char, TrieNode> for O(1) descent.

Structs

Trie

Trie data structure.