huffman.cpp

来自「用加权二叉树」· C++ 代码 · 共 33 行

      #include<iostream>
using namespace std;
#include "huffman.h"

void main(){
    Btree n1,n2,n3,n4,n5,n6,x,y,z,*p;
    n1.data=4;n2.data=6;n3.data=15;n4.data=12;n5.data=2;n6.data=21;
   MinHeap<Btree > zz(11);

   zz.Insert(n1);
   zz.Insert(n2);
   zz.Insert(n3);
   zz.Insert(n4);
   zz.Insert(n5);
   zz.Insert(n6);

   n1.lchild=&n2;
   cout<<n1.lchild->data<<"*******";
   cout<<n2.lchild->data<<"#########";

   for(int i=1;i<6;i++){
     zz.RemoveMin(x);
     zz.RemoveMin(y);
     z=maketree(x,y);
     zz.Insert(z);
     cout<<z.data<<"  ";
      cout<<z.lchild->data<<"   ";}




  }