huffman

说明：  该程序实现二叉树的遍历功能，能够打印出二叉树的节点(The program realization of the binary tree traversal function, is capable of printing out the binary tree node)

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

数据结构（第四版）第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

C语言插入排序算法及代码 C语言中函数参数的传递有：值传递、地址传递、引用传递这三种形式。题一为值传递，题二为地址传递，题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )

哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )

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

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)