哈夫曼的编码译码系统的实现

《哈夫曼的编码译码系统的实现》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、哈夫曼的编码译码系统的实现：BTNode.h源代码：#include#include"BTree.h"#include"PrioQueue.h"#includetemplateclassHfmTree:publicBTree{public:operatorT()const{returnweight;}TgetW(){returnweight;}voidputW(constT&x){weight=x;}SetNull(){root=NULL;}private:Tweight;};template

2、ssT>HfmTreeCreateHfmTree(Tw[],charch[],intn){PrioQueue>pq(n);HfmTreex,y,z,zero;for(inti=0;i

3、pq.Append(z);z.SetNull();}pq.Serve(z);returnz;}voidprint(){charc;cout<<"tttextfile.txt"<

4、ut<q;while(1){cout<

5、ndl;cout<<"tT.遍历"<>ch;switch(ch){case'B':cout<<"t请输入字符集:";cin>>sh;cout<<"t请输入个数:";cin>>n;cout<<"t请输入字符对应的权值:";for(j=0;j>w[j];q=C

6、reateHfmTree(w,sh,n);q.Order();cout<

7、r();cout<#include"BTree.h"#include"PrioQueue.h"#includetemplateclassHfmTree:publicBTree{public:operato