d

另外一个可以实现线性表的程序，简单的操作，值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)

对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)

流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)

包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)

二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。 根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。 写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)

排序二叉树（模板类），主要用于数据排序和查找。已在项目中使用(Sorted binary tree (template class), mainly used for data sorting and searching. Has been used in the project)

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

数据结构的一些基本的相关的试验，如二叉树的遍历，打印，如排序算法，检索算法，动态结构的静态实现实验(Data structures related to some basic tests, such as binary tree traversal, print, such as sorting algorithms, search algorithms, the dynamic structure of the realization of the experimental static)

使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)