Huffman

二叉排序树，可以实现插入，删除，查找，创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)

使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)

数据结构课程设计，多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)

说明：  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)

c语言的一些小李子，初学c的朋友有帮助，主要有顺序表、二分查找、二叉树、单链表等等(Some Survival Song c language, c beginner to help a friend, there are sequence tables, binary search, binary tree, a single linked list, etc.)

数据结构中链式队列和堆栈的循环用法，非常有用(Queue data structure in the chain and the cycle stack usage, very useful)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)

直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)

使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)