# 208. Implement Trie (Prefix Tree) Leetcode Solution

## Implement Trie (Prefix Tree) Leetcode Problem :

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.

## Implement Trie (Prefix Tree) Leetcode Solution :

### Constraints :

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

Intuition :

This is a classic problem of trie implementation.
Trie data structure is used to store the data dictionary and algorithms for searching the words from the dictionary and provide the list of valid words for suggestion can be constructed.

Approach :

1. Implement a trieNode class.
2. Create a trieNode in the trie class and assign its value to NULL

### Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

## Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others