留言板不需要一个数据库通过一个文件来存储信息，但吨..

一个用MFC编写的家庭财务管理系统.采用了Sqlserver数据库.压缩包中已包括了所需的数据库文件.可直接附加到SQL服务器.-Using MFC to prepare a family financial management system. Using sqlserver database. Compressed package includes the necessary database files. Can be directly attached to the SQL server.

用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested

本程序用来学校管理学生挡案用. 采用Access数据库,程序实现关键在应用ODBC 的两个类.-procedures for the management of schools with students archives. Access database, program lies in the application of two types of ODBC.

B-树实现索引和快速查找-B-Tree indexing and quick search

      极大限制了服务器应用程序的使用，本程序采用ICPQ，利用端口实现的聊天室系统，可实现多个用户同时在线聊天，源代码包含了一份官方的文档，并加有注释。

一个数据结构的实验报告的小程序.用c++写的.-a data structure of the small experimental procedures. Using c writes.

一个VB写的UDP协议的C/S模式的服务程序-a VB UDP written in C/S mode service procedures

为了方便大家学习数据结构，上传了一本数据结构的电子书供大家参考-In order to facilitate them to learn from the data structure, the upload of a data structure of the e-books for your reference

我自己从oracle 805 提取得oracle精简客户端程序并且自己开发了一个添加tns的小工具-myself from the oracle oracle made mention 805 client streamline their procedures and the development of a small add tns tools

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of