Ternary Search Trees

Ternary search tree stores keys in sorted order, which can be used as a symbol table.Searching operation is lightning fast, it is reported comparable with hashing table in most cases, and substantially faster than hashing for unsuccessful searches.