Ternary Search Tree - Uses

Uses

Ternary search trees can be used to solve many problems in which a large number of strings must be stored and retrieved in an arbitrary order. Some of the most common or most useful of these are below:

• Anytime a trie could be used but a less memory-consuming structure is preferred.
• A quick and space-saving data structure for mapping strings to other data.
• To implement an auto-complete feature.
• As a spell check
• Near-neighbor searching (Of which a spell-check is a special case)
• As a database especially when indexing by several non-key fields is desirable
• In place of a hash table.