BinaryTree

多项式求和，用链表实现的一元多项式求和程序，比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)

利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（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.)

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)

数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)

数据结构中，运用链表实现四则括号运算等，运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)

二查树遍历文件，可以用于程序测试，有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)

使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)

本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)