🌲(LEETCODE) Trie (Prefix Tree)

Author: kothariji

Leetcode - Top Interview Questions/208. Implement Trie (Prefix Tree).cpp

@@ -0,0 +1,65 @@
+class Trie
+{
+
+    Trie *children[26];
+    bool isEndOfWord;
+
+public:
+    /** Initialize your data structure here. */
+    Trie()
+    {
+
+        isEndOfWord = false;
+        for (int i = 0; i < 26; i++)
+            children[i] = NULL;
+    }
+
+    /** Inserts a word into the trie. */
+    void insert(string word)
+    {
+        Trie *curr = this;
+        for (char c : word)
+        {
+            if (!(curr->children[c - 'a']))
+            {
+                curr->children[c - 'a'] = new Trie;
+            }
+            curr = curr->children[c - 'a'];
+        }
+        curr->isEndOfWord = true;
+    }
+
+    /** Returns if the word is in the trie. */
+    bool search(string word)
+    {
+        Trie *curr = this;
+        for (char c : word)
+        {
+            curr = curr->children[c - 'a'];
+            if (!curr)
+                return false;
+        }
+        return curr->isEndOfWord;
+    }
+
+    /** Returns if there is any word in the trie that starts with the given prefix. */
+    bool startsWith(string prefix)
+    {
+        Trie *curr = this;
+        for (char c : prefix)
+        {
+            curr = curr->children[c - 'a'];
+            if (!curr)
+                return false;
+        }
+        return true;
+    }
+};
+
+/**
+ * Your Trie object will be instantiated and called as such:
+ * Trie* obj = new Trie();
+ * obj->insert(word);
+ * bool param_2 = obj->search(word);
+ * bool param_3 = obj->startsWith(prefix);
+ */