feat(data structures, trees, trie): alphabet trie

Author: BrianLusina

datastructures/trees/trie/__init__.py

@@ -2,5 +2,14 @@
 from datastructures.trees.trie.trie import Trie
 from datastructures.trees.trie.suffix.suffix_tree_node import SuffixTreeNode
 from datastructures.trees.trie.suffix.suffix_tree import SuffixTree
+from datastructures.trees.trie.alphabet_trie.alphabet_trie import AlphabetTrie
+from datastructures.trees.trie.alphabet_trie.alphabet_trie_node import AlphabetTrieNode
 
-__all__ = ["Trie", "TrieNode", "SuffixTreeNode", "SuffixTree"]
+__all__ = [
+    "Trie",
+    "TrieNode",
+    "SuffixTreeNode",
+    "SuffixTree",
+    "AlphabetTrie",
+    "AlphabetTrieNode",
+]

datastructures/trees/trie/alphabet_trie/README.md

@@ -0,0 +1,3 @@
+# Alphabet Trie
+
+This is a trie implementation for an alphabet of size 26 (a-z).

datastructures/trees/trie/alphabet_trie/__init__.py

@@ -0,0 +1,7 @@
+from datastructures.trees.trie.alphabet_trie.alphabet_trie import AlphabetTrie
+from datastructures.trees.trie.alphabet_trie.alphabet_trie_node import AlphabetTrieNode
+
+__all__ = [
+    "AlphabetTrie",
+    "AlphabetTrieNode",
+]

datastructures/trees/trie/alphabet_trie/alphabet_trie.py

@@ -0,0 +1,15 @@
+from datastructures.trees.trie.alphabet_trie.alphabet_trie_node import AlphabetTrieNode
+
+
+class AlphabetTrie:
+    def __init__(self):
+        self.root = AlphabetTrieNode()
+
+    def insert(self, word: str) -> None:
+        node = self.root
+        for char in word:
+            index = ord(char.lower()) - ord("a")
+            if not node.children[index]:
+                node.children[index] = AlphabetTrieNode()
+            node = node.children[index]
+        node.is_end_of_word = True

datastructures/trees/trie/alphabet_trie/alphabet_trie_node.py

@@ -0,0 +1,7 @@
+from typing import List, Optional
+
+
+class AlphabetTrieNode:
+    def __init__(self):
+        self.children: List[Optional[AlphabetTrieNode]] = [None] * 26
+        self.is_end_of_word: bool = False