Insert and search in a trie

interface TrieNode {
  children: Map<string, TrieNode>
  isEndOfWord: boolean
}

export class Trie {
  #root: TrieNode = { children: new Map(), isEndOfWord: false }

  insert(word: string): void {
    let node = this.#root
    for (const ch of word) {
      let next = node.________.get(ch)
      if (next === undefined) {
        next = { children: new Map(), isEndOfWord: false }
        node.children.___(ch, next)
      }
      node = next
    }
    node.__________... = true
  }

  search(word: string): boolean {
    let node: TrieNode | undefined = this.#root
    for (const ch of word) {
      node = node.children.get(ch)
      if (node === undefined) return false
    }
    return node.__________...
  }
}