Huffman Encoding (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


A related problem to the OBST problem is when there is no order between the keys and there are probabilities associated only with the gaps and the objective is to build a binary tree with minimum expected weighted path length from the root. This is called the Huffman Tree Problem

Related Problems

Generalizations: Optimal Binary Search Tree Problem

Related: Approximate OBST, Alphabetic Tree Problem


$n$: number of elements

Table of Algorithms

Currently no algorithms in our database for the given problem.