Optimal Binary Search Tree Problem (Optimal Binary Search Trees)

From Algorithm Wiki
Revision as of 07:52, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Suppose we are given $n$ keys and the probabilities of accessing each key and those occurring in the gap between two successive keys. The optimal binary search tree problem is to construct a binary search tree on these $n$ keys that minimizes the expected access time.

Related Problems

Subproblem: Approximate OBST, Huffman Encoding, Alphabetic Tree Problem

Related: Huffman Encoding, Alphabetic Tree Problem


$n$: number of elements

Table of Algorithms

Currently no algorithms in our database for the given problem.