bfs

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

使用三叉链表实现的哈夫曼树,统计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.)

顺序查找和时间 清华大学出版社 《数据结构 c++》 (search in order)

单链表的增删查改功能,可以实现单链表的创建、传入数据；并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)

八皇后问题，用vc编写了一个可以解决八皇后问题的程序，实现了递归调用。(The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.)