哈夫曼编、译码器(2)

数据结构课程设计报告

};

void ShowNodeBit(LinkList L);//输出每个结点的哈弗码编码 int GetHeight(HuaffmanTreeNode*p);//得到树的高度

3.程序的主要流程图

统计每种字符出现的 1 2 输出原文本 输出 Huafuman3 树 4 输出Huafuman密 5 输出译文 6 T F F

输出每个结点的选择要进行的操作 开始 输入字符串 结束 是否继续? 5

数据结构课程设计报告

4.程序的主要模块

#pragma once #include\#include\#include\

template//模板哈夫曼树类 class HuaffmanTree { };

template

HuaffmanTree::HuaffmanTree() { }

template

HuaffmanTree::~HuaffmanTree() {

this->Root =NULL;

HuaffmanTreeNode *Root;//树根结点 Queue qu;//存放密码 HuaffmanTree(void); ~HuaffmanTree(void);

void SetRoot(HuaffmanTreeNode *p){this->Root=p;} HuaffmanTreeNode *GetRoot(){return Root;}

HuaffmanTreeNode *Merge(HuaffmanTreeNode* pa,HuaffmanTreeNode* pb);//合void CreateTree(LinkList L1);//创建哈夫曼树 int * GetCode(Type data,LinkList L);//得到编码 void Coding(LinkList L);//编码 void DeCode(LinkList L);//译码函数

void Display(HuaffmanTreeNode*p,int n);//遍历哈夫曼树 HuaffmanTreeNode *Find(Type data,LinkList L); void GetCharFrenquency(LinkList L);//得到每种字符出现的次数 void ShowPriorText(LinkList L);

void ShowNodeBit(LinkList L);//输出每个结点的哈弗码编码 int GetHeight(HuaffmanTreeNode*p);//得到树的高度

public:

并两个结点

6

数据结构课程设计报告

}

template HuaffmanTreeNode *HuaffmanTree::Merge(HuaffmanTreeNode

HuaffmanTreeNode *pb) { HuaffmanTreeNode *temp=new HuaffmanTreeNode(); if(pa->GetKey ()GetKey ()) { temp->SetLchild (pa); pa->SetTag (0); temp->SetRchild (pb); pb->SetTag (1); pa->SetFlag (true); pb->SetFlag (true);

} else { temp->SetLchild (pb); pb->SetTag (0); temp->SetRchild (pa); pa->SetTag (1); pa->SetFlag (true); pb->SetFlag (true); }

temp->SetData ('0');

temp->SetKey (pa->GetKey ()+pb->GetKey ()); pa->SetParent (temp); pb->SetParent (temp); return temp;

}

template

void HuaffmanTree::CreateTree(LinkList L1) {

HuaffmanTreeNode *pa,*pb; pa=L1.GetHead ()->GetNext (); pb=pa->GetNext (); while(pb) { HuaffmanTreeNode HuaffmanTreeNode(pa->GetKey()+pb->GetKey(),'0',0);

pa->SetParent(temp);

*pa,

*temp=new

7

数据结构课程设计报告

pb->SetParent(temp);

if(pa->GetKey()>pb->GetKey()) { temp->SetLchild(pb); pb->SetTag(0); pb->SetFlag(true); temp->SetRchild(pa); pa->SetTag(1); pa->SetFlag(true);

} else { temp->SetLchild(pa); pa->SetTag(0); pa->SetFlag(true); temp->SetRchild(pb); pb->SetTag(1); pb->SetFlag(true); }

L1.Insert (temp); pa=pb->GetNext (); if(pa==NULL) { this->SetRoot (pb); return ;

}

pb=pa->GetNext (); if(!pb) { this->SetRoot(pa); return;

}

}

}

template

void HuaffmanTree::Display(HuaffmanTreeNode *p,int n) { if(p==NULL)

return ;

this->Display(p->GetRchild(),n+1); for(int i=0;i

cout<<'\\t';

8

数据结构课程设计报告

if(p->GetData()=='0') cout<GetKey()<

else

{cout<GetKey()<<\<GetData()<<')'<

this->Display(p->GetLchild(),n+1);

}

template

int *HuaffmanTree::GetCode(Type data,LinkList L) { Stack s;int *integer=new int[100];

HuaffmanTreeNode *current=L.GetHead()->GetNext(); while(current) { if(current->GetData()==data) break;

current=current->GetNext(); } if(current) { while(current->GetParent ()) {

s.push(current->GetTag()); current=current->GetParent(); }

} int i=0;

while(!s.Empty()) { qu.EnQueue (s.pop()); i++;

}

return integer;

}

template

HuaffmanTreeNode * HuaffmanTree::Find(Type data,LinkList L) { HuaffmanTreeNode *current=L.GetHead()->GetNext(); while(current) { if(current->GetData()==data)

return current;

current=current->GetNext(); 9