实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是...

与清华大学版的《数据结构》匹配二叉树的实现：BITREE1.CPP：为主程序，其中实现了递归算法以及非递归算法的前序遍历，中序遍历，后序遍历。TSTACK1.H: 为头文件，其中定义了一些常量的值，其中也包括了书中第三章的栈的实现，只需要将注解符去掉即可。运行环境为：VC++6 或 TC3-and Tsinghua University version of the "data structure" matching the achievement of a binary tree : BITREE1.CPP : mainly procedures, which achieved a recursive and non- recursive algorithm of algorithms preorder, preorder, after preorder. TSTACK1.H : for the first document, which defines a number of the value of a constant, which also include a third chapter of the book stack the realization simply have the website notes can be removed. Operating environment : VC 6 or TC3

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

根据广义表创建一棵二叉树，然后中序线索化，再遍历。-Create a table based on generalized binary tree, and then in the sequence of clues, and then traverse.

可以过来看看有关8皇后的相关算法.这是本人初学数据结构运用堆栈编写的小程序-can come look at the Statue of eight correlation algorithm. This is my beginner stack data structure prepared by the use of small programs

根据图书管理的功能要求，结合学校图书管理的实际情况，系统分成以下若干模块：编目、典藏、流通、读者、查询、系统维护。-According to the functional requirements of library management, combined with the actual situation of the school library management, the system divided into several modules: cataloging, collection, circulation, reader, search, system maintenance.

dbf文件的读写类。它直接对dbf文件进行文件级的操作，没有索引-dbf file reader category. It has a direct right dbf files document-class operations and the absence Index

树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.

长整数的乘积求余及应用,能使得大整数的乘积变为小程序- The long integer product strives for-odd and the application, can cause the great integer the product to become the script

图论与网络论中求最短路径的Dijkstra算法-Graph theory and network theory for the Dijkstra shortest path algorithm