数据结构实验报告_图的基本运算及飞机换乘次数最少问题.docVIP

实验报告 实验名称：二叉树的基本操作及哈夫曼编码译码系统的实现 一、问题描述 1.实验目的和要求 a.创建一棵二叉树，实现先序、中序和后序遍历一棵二叉树，计算二叉树结点个数等操作。 b.哈夫曼编码/译码系统。 2.实验任务： 能成功演示二叉树的有关运算，运算完毕后能成功释放二叉树所有结点占用的系统内存 实验内容： ①创建一棵二叉树；②先序、中序和后序遍历这棵二叉树；③计算二叉树结点个数 哈夫曼编码译码系统 二 程序设计 三 .程序代码 主函数： #includeCreateHfmTree.h #includefstream #includestring using namespace std; void main() { coutHfm Coding Systemendlendl; coutM------Show this menu.endl; coutB------Build up tree: read character set and frequency of each character, build up hfm tree.endl; coutT------Trace the tree: PreOrder and InOrder the BTree.endl; coutE------Generate code: According to the builded up hfm tree, generate the codes for all character.endl; coutC------Encode: Input arbitary string formed by characters which have been generated code, utilize the codes to ecode and print the result of encoding.(end with #)endl; coutD------Translate: read codefile.txt, utilize the exisiting hfm tree to translate code and restore code Into hardware file result.txt.endl; coutP------Print: Print the contents of file: textfile.txt, codefile.txt, result.txt on the screen.endl; coutX------Exit: Exit this system.endl; cout-------Delete: Delete character set, character frequencies, codes and HfmTree if they are exist.endl; int w[100]; char data[100]; int n; char choice; int i,j; HfmTreeint hfm; HfmNode* ht; HfmCode* hc; char s[1000]; repeat1: coutendl; coutPlease input your chioce: ; cinchoice; coutendl; if(choice==b || choice==B) { coutPlease input the number of elementary code: ; cinn; cout---------------------------------------------------------------endl; coutAllocating the memory...endl; coutAllocating the complete.endl; cout---------------------------------------------------------------endl; coutPlease input all the elementary codes: endl; for(int i=0;in;i++) cindata[i];