Re: ternary search trees question

new topic     » goto parent     » topic index » view thread      » older message » newer message 

On Tue, 09 Aug 2005 13:08:20 -0700, Tone =8Akoda
<guest at RapidEuphoria.com> wrote:

>What if we insert key "aba" and then "abandon". Since data for key is stor=
ed in eqkid, "aba" can't have any data because eqkid will be required to st=
ore "abandon" key.
>
>Am I missing something?
>
>http://algorithm.myrice.com/resources/technical_artile/ternary_search_tree=
/terstree.htm

Now I've studied that paper, it looks to me like the C code given
stores the terminating null found on all C strings, so it does not
match on the second a of "aba" but the 4th byte, zero.

Regards,
Pete

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu