remove(word) {
    const stack = [];
    let curr = this;

    for (const char of word) {
      if (!curr.children[char]) { return false; }
      stack.push(curr);
      curr = curr.children[char];
    }

    if (!curr.isWord) { return false; }
    let node = stack.pop();

    do {
      node.children = {};
      node = stack.pop();
    } while (node && !node.isWord);

    return true;
  }
Return true if found the word to be removed, otherwise false.
Iterative approach
@param {string} word - The word to remove
@returns {boolean}