开发环境:VC++6.0+MFC 数据库:Oracle 8.0 请将oraclm.dll拷贝到运行文件的目录中! 要运行例子要先装Oracle 8.0，如果有什...

用C++写的寻找公共祖先，实现树的先序后序中序层次遍历，内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.

数据结构中二叉树用c实现的算法-binary tree data structure used to achieve the algorithm c

数据结构课程设计，C语言，其中包含两则，一个是单链表的基本操作，500条语句，另外一个200条，是利用堆栈进行多种运算，均有报告-Curriculum design, data structures, C language, which contains two, one is the basic operation of a single linked list, 500 statements, while a 200 is the use of the stack for a variety of operations, are being reported

是数据结构中的基数排序算法，挺不错的，谢谢大家-Data structure is a sorting algorithm in the base, very good, thank you

数据库编程控件,很有用的-database programming controls, a very useful

一个最短路径算法，具体内容程序开头有介绍-a shortest path algorithm, the specific content of the beginning of a process introduced

the embedded light weight database with source

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

这是一些c语言的常用算法，它可以帮助那些初学c语言的人了解c语言的算法的写法和怎么用的啊-c language commonly used algorithm, it can help those learning the language c c language people understand the wording of the algorithm and how the ah! !