remove2(word, i = 0, parent = this) {
    if (i === word.length - 1) {
      return true;
    }
    const child = parent.children[word.charAt(i)];
    if (!child) return false;

    const found = this.remove(word, i + 1, child);

    if (found) {
      delete parent.children[word.charAt(i)];
    }
    return true;
  }
Return true if found the word to be removed, otherwise false.
recursive approach
@param {string} word - The word to remove
@returns {boolean}