搜索资源列表
HuffmanTree.c
- 赫夫曼编码,它具体点说明了编码的步骤,让初学者一看就明了.-Hefuman coding, it shows a specific encoding step for a beginner can understand it.
huffman
- 课程设计: 任务 :建立最优二叉树函数。 要求:可以建立函数输入二叉树,并输出其赫夫曼树。 -Course Design : Mission : To establish the optimal binary tree function. Requirements : function can be established Binary Tree imported and exported its Hefuman tree.
hefuman
- 赫夫曼树:试构造一棵有n个叶子结点的二叉树,每个叶子节点带权为wi,则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl
hefuman
- 建议赫夫曼树,及对应的赫夫曼编码,译码,翻译,加密。-Huffman tree, and the corresponding Huffman encoding, decoding, translation, encryption is recommended.
hefuman
- 数据结构,哈夫曼树问题。这是大一的数据结构作业,在V6.0下运行流畅无错误-Data structure, Huffman tree problem. This is the first year the data structure operations run smoothly without errors in V6.0
