OpenEuphoria

Re: ternary search trees question

• Posted by Tone Škoda <tskoda at email.si> Aug 10, 2005
• 467 views

Kat wrote:

> 
> The part i hope someone can explain to me is this: how are the branches of=
> 
> such trees ordered, on what criteria, and how is such pre-set-up criteria=
> 
> going to be optimal for a search in any but for the pre-set-up question?


Yes, they are not so easy to clearly understand. That's why I made to myself
this drawing which helps me to understand them clearer:
http://www10.brinkster.com/tskoda/Ternary_Search_Tree_Explanation.html

Speed of search for a word depends on how deeply is that word nested in tree.
How deeply is word nested in tree depends on how late was word inserted in tree,
i.e. words inserted later generally take more time to search, plus how many
similar words already existed in tree when the word was inserted. What means
"similar" here is yet to be more clearly explained.