堆栈的基本功能实现,链表方式实现

汉语拼音对照表，xls文件，带汉字的拼音、声调，可转换成数据库用于数据查询。参考文件Unihan.txt-correction Pinyin CRT, the original schedule from the Internet to collect and then after correction, but without changing the original schedule, based on users change their own circumstances. Unicode Chinese characters are the Chinese characters, reference documents Unihan.txt

链表与数组的数据交换 数据结构的实验基本内容 讲数组中的数存进链表-chain with an array of data exchange data structure of the basic contents of the array of speakers for storing Chain

约瑟夫环源代码,前中后序递归遍历二叉树-Josephus source code, before, during and after recursive traversal sequence binary tree

首先确认您的机器上已经安装了VC6.0以上版本，要编译生成可执行文件，需打开后缀名为dsw的文件，系统会默认用VC打开，然后选择Build菜单下的Set Active Configuration选项，选择Project Configuration为Win32 Release，然后编译项目，得到可执行文件。连接数据库请参照第2章的方法，在ODBC数据源内添加Microsoft Access数据库train.mdb，并将数据源名设定为train即可实现数据库和应用程序的正常连接，程序才能正常实现数据库的访问。另外，如果用户自己编写了.chm的帮助文档只要和可执行文件放在同一个目录下就可以了。 用户要修改程序源码可以选择相应的.h和.cpp文件，本实例使用的命名规则基本是：DIALOG_***** 为管理对话框资源， *****Info为数据输入窗口资源， *****Set为结果集对应的类 -first confirmed your machine has been installed on VC6.0 versions, to build generating executable files, Suffix required to open the document called DSW, the system will default VC opened, then select Build menu under Set Active Configuration options Project Configuration options for Win32 Release. then compile the project, to be executable. Connecting to the database please refer to Chapter 2, the ODBC data source adds Microsoft Access database train.mdb. from the data source can be set to train database, and application of the normal connections, normal procedures can achieve database. In

vb做的，好有意思，-vb done, good interesting.

各个数据库的分页算法,看起来还是很有用的,所以拿出来分享给大家!-Paging algorithm for each database, it seems it is useful, so come to share for everyone!

trigger示范程序-trigger example program

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

用VB6开发商品出租信息管理系统 用VB6开发商品出租信息管理系统-For product development using VB6 lease information management system for product development using VB6 lease information management system

一个表达式求值程序 ACM常用-evaluates an expression commonly used procedures ACM