Optimal binary search tree

Known as: Optimum binary search tree

In computer science, an optimal binary search tree (BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

This paper presents an efficient coarse grain multicomputer CGM parallel algorithm for the cost of the optimal binary search tree…

2010

Suppose we have n keys, n access probabilities for the keys, and n+1 access probabilities for the gaps between the keys. Let…

2009

We present a new linear-time algorithm for constructing multiway search trees with near-optimal search cost whose running time is…

2008

This paper presents a CGM parallel algorithm for the cost of the optimal binary search tree problem (OBST problem). The best…

2006

We describe algorithms for constructing optimal binary search trees, in which the access cost of a key depends on the k preceding…

2004

Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words…

2003

We give linear-time algorithms for re-ordering and height-restricting a binary search tree with only a small increase in cost…

2001

A parallel and a distributed implementation for a very important problem in the searching theory,the optimal binary search tree…

1993

Andersson [1] presented a search algorithm for binary search trees that uses only two-way key comparisons by deferring equality…

1982

SummaryWe show that the cost of an optimal binary search tree can vary substantially, depending only on the left-to-right order…