C# || How To Implement Trie Prefix Tree Using C#

Print Friendly, PDF & Email

The following is a module with functions which demonstrates how to implement a trie prefix tree using C#.

1. Trie – Problem Statement

A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.

Implement the Trie class:

  • Trie() Initializes the trie object.
  • void insert(String word) Inserts the string word into the trie.
  • boolean search(String word) Returns true if the string word is in the trie (i.e., was inserted before), and false otherwise.
  • boolean startsWith(String prefix) Returns true if there is a previously inserted string word that has the prefix prefix, and false otherwise.

Example 1:

["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
[[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
[null, null, true, false, true, null, true]

Trie trie = new Trie();
trie.search("apple"); // return True
trie.search("app"); // return False
trie.startsWith("app"); // return True
trie.search("app"); // return True

2. Trie – Solution

The following is a solution which demonstrates how to implement a trie prefix tree.

The highlighted lines are sections of interest to look out for.

The code is heavily commented, so no further insight is necessary. If you have any questions, feel free to leave a comment below.

Once compiled, you should get this as your output for the example cases:


Was this article helpful?
👍 YesNo

Leave a Reply