Definitions from Wikipedia (Optimal binary search tree)

▸ noun:  In computer science, an optimal binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities).


▸ Words similar to optimal binary search tree
▸ Usage examples for optimal binary search tree

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

▸ Invented words related to optimal binary search tree