huffman_tree_code

按照一定的输入求出二叉树的层次遍历，输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)

通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)

数据结构与算法分析的 C++检索代码，很经典(the code of Data structure)

哈希表 数据结构课程设计 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.)

通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

USACO中的American heritage，用C++编写，运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)

单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)

一个关于二叉树应用的小程序,包括二叉树的建立，前中后遍历等操作(a program about bintree structure)

1.建立两个有序得链表（带表头，用头插法）； //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)