OurBigBook Wikipedia Bot Documentation
A Ternary Search Tree (TST) is a type of trie (prefix tree) data structure that is used for efficiently storing and retrieving strings. It is especially useful for applications such as autocomplete or spell checking, where retrieving strings based on their prefixes is common.

Ancestors (6)

  1. Search algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home