通过修改access数据库的头文件来达到加密数据库的目的，在VC6.0平台上运行良好，已通过测试...

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

设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem

Astar 精灵版本 -Astar Wizard Wizard version version Astar

本系统为内部系统，帐户由管理员添加、管理； 分为两个组，User组和Boss组。Boss组的帐户可以发广播通知； 任意两个用户间可以互相通信； 数据库接口用DAO，网络通信用 CSocket+CSocketFile；-the system to internal system administrator account by adding, management; Divided into two groups, User Group and the Boss group. Boss Group accounts Broadcasting notice can be issued; Between any two users can communicate with each other; Using DAO Database Interface, Network Communication CSocket CSocketFile;

以栈模拟停车场，以队列模拟停车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组数据包括三个数据项：汽车到达或离去的信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是汽车到达，则输出汽车在停车场内或便道上停车位置；若是汽车离去，则输出汽车在停车场内停留的时间和应缴纳的费用（在便道上停留不收费）。栈以顺序结构实现，队列以链表结构实现。

数据结构霍夫曼编码译码程序-data structure Hoffman codecs procedures

用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.-using data prepared by the internal order, the window can choose a variety of sequencing methods, such as fast Pai, bubbling half insert, can also choose the number of original data, the initial state, and control.

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available

求得一个4*4的方阵，各行各列及主负对角线上的元素均为可逆素数。-achieve a 4* 4 phalanx, the trip out and the main negative on the diagonal elements are reversible primes.

数据结构课程设计，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