Huffman Encoding: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 12: Line 12:
== Parameters ==  
== Parameters ==  


<pre>n: number of elements</pre>
n: number of elements


== Table of Algorithms ==  
== Table of Algorithms ==  


Currently no algorithms in our database for the given problem.
Currently no algorithms in our database for the given problem.

Revision as of 13:02, 15 February 2023

Description

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

Parameters

n: number of elements

Table of Algorithms

Currently no algorithms in our database for the given problem.