internal TrieNode(TrieNode <T> parent, T value)
{
Parent = parent;
Value = value;
Children = new Dictionary <T, TrieNode <T> >();
}
internal TrieEnumerator(TrieNode <T> root)
{
this.root = root;
}
public Trie()
{
root = new TrieNode <T>(null, default(T));
Count = 0;
}
