Search results
We did not find results for: optimal binary search algorithm.
Check spelling or type a new query.
Yahoo Web Search
- Optimal binary search tree
Computer science concept
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). Optimal BSTs are generally divided into two types: static and dynamic. In the static optimality problem, the tree cannot be mod... Wikipedia
