Re: How to implement a prefix tree?
- Robert Sedgewick, the same guy who wrote my favorite algorithms book,
has a paper on Ternary trees and related stuff. Check out:
I also found a rumor that such an algorithm is already included in
"libiberty", whatever that is; Check out:
> A more reasonable method, that I haven't tried myself but saw inbooks, is
> ternary trees: when you have the next input character "g", you don'tdecide
> what to do based on just one node; Instead, say the node holds acharacter "e".
> You now go to one of three possible nodes based on whether "g" issmaller than,
> equal or larger than "e". Unless you chose the "equal" case, youcontinue
> with the same input character without going forward to the next one.Tishri 5764
> Check out your favorite algorithm for the ternary tree algorithm, or if
> you can't find it ask me for a reference.
> Good luck.
> Nadav Har'El | Saturday, Oct 25 2003, 30
> nyh@m... |-----------------------------------------clause.
> Phone: +972-53-790466, ICQ 13349191 |A cat has claws ending its paws. A
> http://nadav.harel.org.il |sentence has a pause ending its