使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解...

宠物店对各个宠物信息录入的数据库，可以方便的查找宠物的信息。-Pets pet store the information for each database entry, you can easily find pet information.

这是一个数据结构小程序，有关计算加减法的-This is a small program data structure, addition and subtraction in the calculation of

抽奖系统使用 miicrosoft 接入，作为后端数据库这是好的项目:) 歉意乱码

本源码为图书管理系统，实现了密码登陆管理，图书基本信息的录入、修改、删除、查询，读者基本信息的录入、修改、删除、查询，实现了自动从系统取得借书时间，自动生成还原时间，和自动对超期信息的统计-source for the library management system and realized the landing password management, basic information on the book entry, modification, deletion, inquiries, readers basic information on the entry, modification, deletion, inquiries, and realized from the system automatically library, automatic generation reduction, and automatic extended to the statistical information

一个曲线类，可用于Dialog，也可用于View-a curve type can be used Dialog also can be used to View

n个数的全排列的非递归算法，cpp文件可编译运行-n the number of full-order non-recursive algorithm, cpp files can be compiled to run

VB6.0下对Access数据库文件进行查找、添加、删除记录的源代码！-VB6.0 under the Access database files to search, add, delete records of the source code!

物业缴费管理系统-property Payment Management System

是一个很不错的软件噢-is a very good software Oh

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree