hnaegrity

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize

IWEOQ FJ VNXCJOIAEAFAG DFGADFXAE

对学数据结构的朋友很帮助(Data on the structure of a friend is to help)

这是用链表实现的栈数据结构。链表数据结构的最大优点是不受元素个数的限制，除非内存耗尽。-This is the stack implementation with linked list data structure. List data structure is not subject to the greatest advantage of the restricted number of elements, unless the memory run out.

字符串计算公式，在编辑框输入你想要的计算公式，本程序，只提供几个简单的函数，只要是C支持的函数你可以在相应的控件函数里面添加！-string formula, the editorial input box you want the formula for calculating the process, only a few simple functions, as long as C is a function of your support in the corresponding control functions add inside!

一个效率可以的线段树代码 可以直接用来求解矩形面积并 另外可以修改实现更多功能.-The efficiency of the line segment can be a tree code can be directly used to solve the rectangular area and the other can be modified to achieve more.

对文件进行文本文件处理 并采用递归法把查到的信息插入到树中-a file processing program, process a file and insert the information from the file to a tree

实现了二叉排序树的所有功能 建立，增，删，改，查 -Achieved a binary sort tree all the features of the establishment, increase, delete, change, check

这是一个关于delphi数据库方面的源程序-This is a database of delphi the source