Definitions from Wikipedia (Ternary search tree)

▸ noun:  In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two.


▸ Words similar to Ternary search tree
▸ Usage examples for Ternary search tree

▸ Idioms related to Ternary search tree
▸ Wikipedia articles (New!)
▸ Words that often appear near Ternary search tree
▸ Rhymes of Ternary search tree

▸ Invented words related to Ternary search tree