Huffman Tree Algorithm

form a node for each symbol ai with weight pi;

insert the nodes in a min priority queue ordered by probability;

while the priority queue has more than one element do

min1 := delete-min;

min2 := delete-min;

create a new node n;

n.weight := min1.weight + min2.weight;

n.left := min1;

n.right := min2;

insert(n)

return the last node in the priority queue.

Previous slide

Next slide

Back to first slide

View graphic version