\
## Task description:

A **[trie](https://en.wikipedia.org/wiki/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:**

```javascript
Input
["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
[[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
Output
[null, null, true, false, true, null, true]
```

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

\
**Constraints:**

* `1 <= word.length, prefix.length <= 2000`
* `word` and `prefix` consist only of lowercase English letters.
* At most `3 * 10^4` calls **in total** will be made to `insert`, `search`, and `startsWith`.

\
## Reasoning:

[Trie](https://en.wikipedia.org/wiki/Trie) is the classic data structure that is widely used. One of the most famous uses is text searching. Let’s take Google.com as an example.

\
 ![](https://miro.medium.com/max/1254/1\*zJwVhMm4pndP8dM47KGTNw.png)

\
### Google’s example

Have you ever noticed whenever you start typing a search phrase to a search bar you almost immediately get some suggestion from the searching system? I bet the answer is “Yes”. The Trie data structure makes it possible.

\
Let’s add some words to Trie and see how it looks like this:

\
 ![](https://miro.medium.com/max/682/1\*jFvPwFhJcd3k0uEFyJtBtA.png)

### Example of Trie with some words

The Trie above contains words: Algorithm, Animation, Ant, Apache, Append, Apple, Application, Apricot. As you may notice we treat every word as a sequence of characters. 

\
Starting from the first character of each word we attach it to the root of the **Trie** and move down till we reach the last character of each word. 

\
Once we reached the end of a word we mark that last **Node** as the end of the word. I hope now it’s clear to you how it works in general. If you still struggle with it, I recommend you to read [Wikipedia’s article](https://en.wikipedia.org/wiki/Trie).

\
## Solution:

We are to implement Trie with the following method:

\
<https://gist.github.com/RakhmedovRS/a53ea510ad97088fdfd4829209d405b2>

\
As we saw in the example of real **Trie** we had to notice that as with any other **Tree** data structure it consists of smaller pieces which are usually called **Node**. Let’s introduce this small part:

\
<https://gist.github.com/RakhmedovRS/bb2a188cd156565b692af1f5262d96a3>

\
A few things we need to have a closer look at here:

We have the **chars** boolean array which will tell us if we have particular characters in a particular node. **isEnd** boolean variable which answers just one question, whether or not the current node is the end of a word in our Trie. Last but not least **children** TrieNode array stores child TrieNodes of the current TrieNode.

\
Let’s look at other methods, one by one:


---

Method `void insert(String word)`returns nothing and accepts word to insert into the Trie:

\
<https://gist.github.com/RakhmedovRS/b460db4fd040a47ca33e8afc401af7c0>

\
Starting from the root of the Trie we iterate through every char in provided word and create a new TrieNode every time if we don’t have one. At the last character in word, we mark TrieNode as **isEnd.**

\

---

The next method in our list is `boolean search(String word)` which searches for a particular word in the Trie and returns a boolean value depending on whether or not the Trie contains it. As input, it takes a word.

\
<https://gist.github.com/RakhmedovRS/18bb68c4e83f3c602afa4a338e96fbc2>

\
Here we do the same as in the previous method except for a few things. Iterate through every character in provided word and if we don’t have a child with the next character we return false. At the end of a word, we return the current node value of **isEnd**.

\

---

Lastly method `boolean startsWith(String prefix)`takes prefix and returns true if we have a prefix in our Trie if not we return false.

\
<https://gist.github.com/RakhmedovRS/d25842ef37c339e6260ef50097713e84>

\
This method does completely the same as the previous one except for only one thing. If we managed to iterate through the whole prefix we return true, because we’re looking for the prefix and not an entire word, otherwise we return false.

\
As always at the end of the article, I prove the full source code of the problem

\
<https://gist.github.com/RakhmedovRS/cff7b0ea83d0a598c86c7b9aac834425>

\
It has linear time and space complexity and has the following position among other people's solutions.

\
 ![Submission detail](https://miro.medium.com/max/1400/1\*Bmysuz1LZHam5_FR_ndbrQ.png)

\

---

Also published [here](https://medium.com/p/c83970a8b883).

Apache

Apple

Google

2022 - HackerNoon Contributor of the Year - Algorithms

2022 - HackerNoon Contributor of the Year - Coding

2022 - HackerNoon Contributor of the Year - Java

Nominated for 2022 - HackerNoon Contributor of the Year - Algorithms

Nominated for 2022 - HackerNoon Contributor of the Year - Java

Nominated for 2022 - HackerNoon Contributor of the Year - Coding

Too Long; Didn't Read

Cassandra Forward a free Cassandra-focused community event

How to Implement Trie (Prefix Tree) - Blind 75 LeetCode Questions

How to Implement Trie (Prefix Tree) - Blind 75 LeetCode Questions

Too Long; Didn't Read

Companies Mentioned

@rakhmedovrs

RELATED STORIES