Implement Trie (Prefix Tree)
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:
Input
["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
[[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
Output
[null, null, true, false, true, null, true]
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 * 104 calls in total will be made to insert, search, and startsWith.
Solution :
Solution in C :
#define N 26
typedef struct Trie{
struct Trie* children[N];
bool is_leaf;
}Trie;
Trie* trieCreate() {
Trie* node = malloc(sizeof(Trie));
for(int i = 0; i < N; i++){
node->children[i] = NULL;
}
node->is_leaf = false;
return node;
}
void trieInsert(Trie* obj, char * word) {
Trie* tmp = obj;
for(int i = 0; word[i] != '\0'; i++){
int idx = word[i] - 'a';
if(tmp->children[idx] == NULL){
tmp->children[idx] = trieCreate();
}
tmp = tmp->children[idx];
}
tmp->is_leaf = true;
}
bool trieSearch(Trie* obj, char * word) {
Trie* tmp = obj;
for(int i = 0; word[i] != '\0'; i++){
int idx = word[i] - 'a';
if(tmp->children[idx] == NULL)
return false;
tmp = tmp->children[idx];
}
return tmp->is_leaf ;
}
bool trieStartsWith(Trie* obj, char * prefix) {
Trie* tmp = obj;
for(int i = 0; prefix[i] != '\0'; i++){
int idx = prefix[i] - 'a';
if(tmp->children[idx] == NULL)
return false;
tmp = tmp->children[idx];
}
return true ;
}
void trieFree(Trie* obj) {
Trie* tmp = obj;
for(int i = 0; i < N; i++){
if(tmp->children[i] != NULL)
trieFree(tmp->children[i]);
}
free(obj);
}
Solution in C++ :
class TrieNode {
public:
TrieNode *child[26];
bool isWord;
TrieNode() {
isWord = false;
for (auto &a : child) a = nullptr;
}
};
class Trie {
TrieNode* root;
public:
Trie() {
root = new TrieNode();
}
void insert(string s) {
TrieNode *p = root;
for (auto &a : s) {
int i = a - 'a';
if (!p->child[i]) p->child[i] = new TrieNode();
p = p->child[i];
}
p->isWord = true;
}
bool search(string key, bool prefix=false) {
TrieNode *p = root;
for (auto &a : key) {
int i = a - 'a';
if (!p->child[i]) return false;
p = p->child[i];
}
if (prefix==false) return p->isWord;
return true;
}
bool startsWith(string prefix) {
return search(prefix, true);
}
};
Solution in Java :
class Trie {
Node root;
public Trie() {
root = new Node();
}
public void insert(String word) {
root.insert(word, 0);
}
public boolean search(String word) {
return root.search(word, 0);
}
public boolean startsWith(String prefix) {
return root.startsWith(prefix, 0);
}
class Node {
Node[] nodes;
boolean isEnd;
Node() {
nodes = new Node[26];
}
private void insert(String word, int idx) {
if (idx >= word.length()) return;
int i = word.charAt(idx) - 'a';
if (nodes[i] == null) {
nodes[i] = new Node();
}
if (idx == word.length()-1) nodes[i].isEnd = true;
nodes[i].insert(word, idx+1);
}
private boolean search(String word, int idx) {
if (idx >= word.length()) return false;
Node node = nodes[word.charAt(idx) - 'a'];
if (node == null) return false;
if (idx == word.length() - 1 && node.isEnd) return true;
return node.search(word, idx+1);
}
private boolean startsWith(String prefix, int idx) {
if (idx >= prefix.length()) return false;
Node node = nodes[prefix.charAt(idx) - 'a'];
if (node == null) return false;
if (idx == prefix.length() - 1) return true;
return node.startsWith(prefix, idx+1);
}
}
}
Solution in Python :
class Trie:
def __init__(self):
self.root={}
def insert(self, word: str) -> None:
cur=self.root
for letter in word:
if letter not in cur:
cur[letter]={}
cur=cur[letter]
cur['*']=''
def search(self, word: str) -> bool:
cur=self.root
for letter in word:
if letter not in cur:
return False
cur=cur[letter]
return '*' in cur
def startsWith(self, prefix: str) -> bool:
cur=self.root
for letter in prefix:
if letter not in cur:
return False
cur=cur[letter]
return True
View More Similar Problems
Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →