Trie (Prefix Tree) Veri Yapısı

1class TrieNode {
2  children = new Map();
3  isEndOfWord = false;
4}
5
6class Trie {
7  root = new TrieNode();
8
9  insert(word: string): void {
10    let node = this.root;
11    for (const char of word) {
12      if (!node.children.has(char)) {
13        node.children.set(char, new TrieNode());
14      }
15      node = node.children.get(char)!;
16    }
17    node.isEndOfWord = true;
18  }
19
20  search(word: string): boolean {
21    let node = this.root;
22    for (const char of word) {
23      if (!node.children.has(char)) return false;
24      node = node.children.get(char)!;
25    }
26    return node.isEndOfWord;
27  }
28
29  startsWith(prefix: string): boolean {
30    let node = this.root;
31    for (const char of prefix) {
32      if (!node.children.has(char)) return false;
33      node = node.children.get(char)!;
34    }
35    return true;
36  }
37}