Trie (Prefix Tree) · Medium

Implement Trie (Prefix Tree)

O(L) per op · O(N * L)

Step 1: Setup & Initialization - Implement Trie

Traverse node edges character by character.

Array Elements & Pointers
10
[0]
20
[1]
30
[2]
40
[3]
50
[4]
Live Variables & Invariants
status:Initialized
pattern:Implement Trie
Step 1 / 3
33%
Solution Code
1
class Trie {
2
  root = {};
3
  insert(word: string) {
4
    let node: any = this.root;
5
    for (const c of word) { node[c] = node[c] || {}; node = node[c]; }
6
    node.isEnd = true;
7
  }
8
}
LeetCode IDE Console

Test Cases

2 cases from Blind 75 & NeetCode 150

Ask for a hint whenever you get stuck.