binarytree

用模板实现了单向链表的增删改查等功能，并且适用于多种数据结构和类，简单实用，是学习和使用的绝好资料(Template to achieve a one-way linked list CRUD functions, and is suitable for a variety of data structures and classes, simple and practical, is to learn and use excellent information)

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.)

说明：  《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)

总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)

数据结构中的一元多项式相加，多于考研算法实现很重要。后续部分将在后期上传！(The sum of Multinomial)

最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)

用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)

利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（1）转换为后缀表达式并输出；（2）对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号，运算符包括+、-、*、/、#（代表单目负）。可以多次输入不同的表达式进行计算，直到用户选择“退出”。栈的基本操作可以自己实现，也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

算法分析与设计——大整数乘法。 计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)