clipka <nomail@nomail> wrote:
> This would require your data to have a linear distribution.

  No, it doesn't. For an alphabet of eg. 26 characters you need to perform
at most 5 steps per character, period, completely regardless of what the
stored strings are.

  With an unbalanced tree the worst case scenario is that you end up having
to perform 25 steps per character.

-- 
                                                          - Warp

Post a reply to this message