Monkeys-and-peach

VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)

程序可以实现哈弗曼自动编码功能！很详细的！很有参考价值！(Program can be Havermann automatic coding features! Very detailed! A good reference!)

数据结构作业－停车场管理(operating data structure-the car park management)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)

说明：  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)

读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。 根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。 写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。 (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)

说明：  线性链表的定义，遍历，查找，删除，排序。(Linear list definition, traversal, search, delete, sort.)