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.

2015

In 1971, Knuth gave an \(O(n^2)\)-time algorithm for the classic problem of finding an optimal binary search tree. Knuth’s…

2010

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

2010

An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is…

2009

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we…

2008

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

2008

Abstract In this paper, we propose to extend the Peril-Lparallel pseudo-code language. The extensions addedto the Peril-L are…

2006

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

2004

The goal of self-optimising control is to select a set of controlled variables, which when kept at constant setpoints, indirectly…

2001

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

1982

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