Create Implement Trie (Prefix Tree) - Leetcode 208.py

Author: gahogg

Implement Trie (Prefix Tree) - Leetcode 208.py

@@ -0,0 +1,36 @@
+class Trie:
+    def __init__(self):
+        self.trie = {}
+
+    def insert(self, word: str) -> None:
+        d = self.trie
+
+        for c in word:
+            if c not in d:
+                d[c] = {}
+            d = d[c]
+
+        d['.'] = '.'
+
+    def search(self, word: str) -> bool:
+        d = self.trie
+
+        for c in word:
+            if c not in d:
+                return False
+            d = d[c]
+
+        return '.' in d
+
+    def startsWith(self, prefix: str) -> bool:
+        d = self.trie
+
+        for c in prefix:
+            if c not in d:
+                return False
+            d = d[c]
+
+        return True
+        
+        # Time: O(N) where N is the length of any string
+        # Space: O(T) where T is the total number of stored characters