docs: public CharTrie reduce(CharTrie right, BiFunction<TrieNode, TrieNode, TreeMap<Character, Long>> fn) {
      CharTrie result = new CharTrieIndex();
      reduceSubtree(root(), right.root(), result.root(), fn);
      return result.recomputeCursorDetails();
    }