Huffman-Tree

说明：   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)

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

一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)

说明：  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)

COM中使用SAFEARRAY数组例程，代码中给了两种数组的用法，一种是字符串数组，另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)

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

C语言课程设计例子，迷宫的实现，包括了需求分析，概要设计，详细设计，测试，源代码等(C language curriculum design example, the realization of the maze, including requirements analysis, preliminary design, detailed design, testing, source code, etc.)

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)