trie data structure

PrashantUnity answered on March 17, 2023 Popularity 10/10 Helpfulness 1/10

answer trie data structure

trie data structure

Comment

Implemented using Dictionary

public class Node
{
    public Dictionary<char,Node> value  { get; set; } = new  Dictionary<char,Node>(); 
    public bool IsEndOfWord = false;
}
public class Trie 
{
    Node  node;
    public Trie() 
    { node = new Node();} 
    public void Insert(string word) 
    {
        var temp = node;
        foreach(var i in word)
        {
            if(!temp.value.ContainsKey(i)) temp.value.Add(i,new Node());  
            temp = temp.value[i];
        }
        temp.IsEndOfWord=true;
    } 
    public bool Search(string word) => SearchHelper(word,true); 
    public bool StartsWith(string prefix) => SearchHelper(prefix,false);
    public bool SearchHelper(string word,bool search)
    {
        var temp = node;
        foreach(var i in word)
        {
            if(!temp.value.ContainsKey(i)) return false;  
            temp = temp.value[i];
        }
        if(search) return temp.IsEndOfWord;
        return true;
    }
}

https://leetcode.com/problems/implement-trie-prefix-tree/solutions/3306412/using-dictionary/

Popularity 10/10 Helpfulness 1/10 Language csharp

Source: Grepper

Tags: c# structure trie

Link to this answer
Share Copy Link