Optimal Binary Search Tree Problem (Optimal Binary Search Trees)
Revision as of 11:21, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Optimal Binary Search Tree Problem (Optimal Binary Search Trees)}} == Description == 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 Pr...")
Description
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
Parameters
n: number of elements
Table of Algorithms
Currently no algorithms in our database for the given problem.