Time: 88 ms (26.44%), Space: 44 MB (79.32%) - LeetHub

Author: ayushnagar123

implement-trie-prefix-tree/implement-trie-prefix-tree.cpp

@@ -0,0 +1,66 @@
+class Node {
+  public:    
+      char data;
+      unordered_map<char,Node*> m;
+      bool is_terminal;
+      
+      Node(char d){
+        data = d;
+        is_terminal = false;
+      }
+};
+
+
+class Trie {
+public:
+    Node* root;
+
+    Trie() {
+        root = new Node('\0');
+    }
+    
+    void insert(string word) {
+        Node* temp = root;
+
+        for(char ch: word){
+            if(temp->m.count(ch)==0){
+                Node* n = new Node(ch);
+                temp->m[ch] = n;
+            }
+            temp = temp->m[ch];
+        }
+        temp->is_terminal = true;
+    }
+    
+    bool search(string word) {
+        Node* temp = root;
+
+        for(char ch: word){
+            if(temp->m.count(ch)==0){
+                return false;
+            }
+            temp = temp->m[ch];
+        }
+        return temp->is_terminal;
+    }
+    
+    bool startsWith(string prefix) {
+        Node* temp = root;
+
+        for(char ch: prefix){
+            if(temp->m.count(ch)==0){
+                return false;
+            }
+            temp = temp->m[ch];
+        }
+        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);
+ */