Iterative Ternary Search Algorithm

like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the price of speed.

Iterative Ternary Search source code, pseudocode and analysis