If there are no confluence states in the common prefix, then the method of adding the rest of the word does not differ from the method used in the algorithm for sorted data.
we need to withdraw (from the register) the last state in the common prefix path in order not to create cycles.