0208-implement-trie-prefix-tree.cs

publicclassTrieNode{
publicTrieNode(){
childrenMap=newDictionary<char,TrieNode>();
}
publicDictionary<char,TrieNode>childrenMap{get;set;}
publicboolisWord{get;set;}
}
publicclassTrie{

privateTrieNoderoot;
publicTrie(){
root=newTrieNode();
}

publicvoidInsert(stringword){
varcur=root;
foreach(varcinword){
if(!cur.childrenMap.ContainsKey(c)){
cur.childrenMap[c]=newTrieNode();
}
cur=cur.childrenMap[c];
}
cur.isWord=true;
}

publicboolSearch(stringword){
varnode=traverse(word);
returnnode!=null&&node.isWord;
}

publicboolStartsWith(stringprefix){
varnode=traverse(prefix);
returnnode!=null;
}

privateTrieNodetraverse(stringpath){
varcur=root;

foreach(varcinpath){
if(cur.childrenMap.ContainsKey(c)){
cur=cur.childrenMap[c];
}
else{
returnnull;
}
}
returncur;
}
}

/**
 * Your Trie object will be instantiated and called as such:
 * Trie obj = new Trie();
 * obj.Insert(word);
 * bool param_2 = obj.Search(word);
 * bool param_3 = obj.StartsWith(prefix);
 */