implement-trie-prefix-tree solution (py, ts)

Author: hi-rachel

implement-trie-prefix-tree/hi-rachel.py

@@ -0,0 +1,45 @@
+# Trie Data Structure 구현
+# TC: O(n), SC: O(N)
+# autocomplete and spellchecker 등에 사용
+
+class Node:
+    def __init__(self, ending=False):
+        self.children = {}
+        self.ending = ending
+
+class Trie:
+    def __init__(self):
+        self.root = Node(ending=True)  # 노드 객체 생성
+
+    def insert(self, word: str) -> None:
+        node = self.root  #Trie의 최상위 노드부터 시작 
+        for ch in word:
+            if ch not in node.children:
+                node.children[ch] = Node()  # 새로운 노드 생성
+            node = node.children[ch]
+        node.ending = True
+
+    def search(self, word: str) -> bool:
+        node = self.root
+
+        for ch in word:
+            if ch not in node.children:
+                return False
+            node = node.children[ch]
+        return node.ending
+        
+    def startsWith(self, prefix: str) -> bool:
+        node = self.root
+        
+        for ch in prefix:
+            if ch not in node.children:
+                return False
+            node = node.children[ch]
+        return True
+
+
+# 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)

implement-trie-prefix-tree/hi-rachel.ts

@@ -0,0 +1,54 @@
+class TrieNode {
+  children: Map<string, TrieNode>;
+  ending: boolean;
+
+  constructor(ending = false) {
+    this.children = new Map();
+    this.ending = ending;
+  }
+}
+
+class Trie {
+  private root: TrieNode;
+
+  constructor() {
+    this.root = new TrieNode(true);
+  }
+
+  insert(word: string): void {
+    let node = this.root;
+    for (const ch of word) {
+      if (!node.children.has(ch)) {
+        node.children.set(ch, new TrieNode());
+      }
+      node = node.children.get(ch)!; // 노드 포인터를 ch로 이동
+    }
+    node.ending = true;
+  }
+
+  search(word: string): boolean {
+    let node = this.root;
+    for (const ch of word) {
+      if (!node.children.has(ch)) return false;
+      node = node.children.get(ch)!;
+    }
+    return node.ending;
+  }
+
+  startsWith(prefix: string): boolean {
+    let node = this.root;
+    for (const ch of prefix) {
+      if (!node.children.has(ch)) return false;
+      node = node.children.get(ch)!;
+    }
+    return true;
+  }
+}
+
+/**
+ * Your Trie object will be instantiated and called as such:
+ * var obj = new Trie()
+ * obj.insert(word)
+ * var param_2 = obj.search(word)
+ * var param_3 = obj.startsWith(prefix)
+ */