Example #1
0
void huffman(List<BinaryTree> l)
// @l@ is a list of single node binary trees as described above
{
   int n = l.Size(); // number of binary trees in l
   for (int i = 0; i < n-1 ; i++) { // loop n-1 times
       BinaryTree first = l.DeleteMinWeight();
       BinaryTree second = l.DeleteMinWeight();
       BinaryTree *bt = new BinaryTree(first, second);
       l.Insert(bt);
   }
}