数据库访问原代码

与清华大学版的《数据结构》匹配二叉树的实现：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

通过现有的人口数据结构特点，对其进行拟合分析后进行长短期的预测-Population data through the existing structural features, their post-fitting analysis of the short and long-term prediction

用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help

几个常见的算法,为c语言编写，在VC6.0环境下编写。-Several common algorithms, for the c language, in the preparation of VC6.0 environment.

Jsp考试系统 -Jsp Examination System

用来输入姓名查询地址-used to input the names address inquiries

这个系统是同学给我的，主要是要我熟悉Visual Studio 2008 与SQL Server 2008 的结合使用，她说这个系统比较简单也适合初学者使用，我从中学到了很多东西，希望有的同学也能用到这个系统，能简单使用Visual Studio 2008 。

参考课堂迷宫问题的解题方法，建立move数组，若马当前位置是（x,y）,则沿着第i(1

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.

用Matlab实现的Dijkstra算法源码。主要用于求最短路径。-Using Matlab source realize the Dijkstra algorithm. Mainly used for the shortest path.