Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Ternary search tree
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a ternary search tree is a type of <a href="/facts/Trie/cXNr0ScT">trie</a> (sometimes called a <i>prefix tree</i>) where nodes are arranged in a manner similar to a <a href="/facts/Binary_search_tree/gWubNt7b">binary search tree</a>, but with up to three children rather than the binary tree's limit of two. Like other prefix trees, a ternary search tree can be used as an <a href="/facts/Associative_map/IFGd2xcP">associative map</a> structure with the ability for incremental <a href="/facts/String_search/RCvwDRle">string search</a>. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include <a href="/facts/Spell-check/Dg3GUjUd">spell-checking</a> and <a href="/facts/Auto-completion/eLNAGYlS">auto-completion</a>. </p>