二叉树有三种遍历方法，引用树的概念实现遍历

数值计算源代码，包括二分法，弦截法，龙贝格算法，下山法，牛顿迭代法-numerical source code, including the dichotomy, chord sheet, Lung Bergh algorithm, the mountain, the Newton iterative method

(1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

仅用数据结构中的单链表就可实现集合的交、并与两个集合之差，-Only data structure in a single list can realize cross-collection, and the difference between the two collections,

c数据结构的经典示例

这是我的数据结构课程设计源代码，请务必按提示输入数据，该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.

图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used

oracle存储过程后优化-oracle memory process optimizes

由于时间仓促，所以功能比较简单。有兴趣者可以继续扩展这个系统！-Because time is so short, relatively simple function. Interested persons can continue to expand this system!

二叉树操作源代码，以及关键源代码的注解说明-Operation of the source code tree, as well as the key to the source code annotation Help