Update 208. Implement Trie (Prefix Tree).py

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/208. Implement Trie (Prefix Tree)/208. Implement Trie (Prefix Tree).py

@@ -0,0 +1,37 @@
+class Trie:
+    def __init__(self):
+        self.children = [None] * 26
+        self.is_end = False
+
+    def insert(self, word: str) -> None:
+        node = self
+        for c in word:
+            idx = ord(c) - ord('a')
+            if node.children[idx] is None:
+                node.children[idx] = Trie()
+            node = node.children[idx]
+        node.is_end = True
+
+    def search(self, word: str) -> bool:
+        node = self._search_prefix(word)
+        return node is not None and node.is_end
+
+    def startsWith(self, prefix: str) -> bool:
+        node = self._search_prefix(prefix)
+        return node is not None
+
+    def _search_prefix(self, prefix: str):
+        node = self
+        for c in prefix:
+            idx = ord(c) - ord('a')
+            if node.children[idx] is None:
+                return None
+            node = node.children[idx]
+        return node
+
+
+# Your Trie object will be instantiated and called as such:
+# obj = Trie()
+# obj.insert(word)
+# param_2 = obj.search(word)
+# param_3 = obj.startsWith(prefix)