用链表来实现的一个学生成绩管理管理系统，操作简单，清晰明了。...

《数据结构与算法》讲义，第3章 栈与队列。 “十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。-Chap3 Stack and List

odbc教程真的很不错-odbc Guide is really quite

一个关于数据结构哈夫曼编/译码的程序-Another Huffman tree coding Algorithm for Data Structure.

非常好用的在线考试系统，本版本为测试版，如有兴趣请购买正式版-Very easy to use online testing system, the beta version, if interested, please buy the official version

这个简单的程序写的是几种不同的对二叉树的遍历算法，在数据结构中经常可以看到。-This simple procedure is to write several different types of the traversal algorithm for binary tree in data structure can be seen frequently.

This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table. -This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wr

这是一个简单的Base64串编码器/解码器，以通过互联网协议的电子邮件，密码等转换成Base64的使用。 这样做的一个常见的用途是做SMTP连接身份验证的用户名和密码进行编码。它支持NULL字符也是如此。

堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack

双线程对一系列随机数进行归并排序，使用MFC的控制台程序-Dual-threaded on a series of random numbers to merge sort, using the Console application in MFC

二叉树的先序遍历，使用栈实现（构造空栈，初始化栈）-The first order binary tree traversal, use the stack to achieve (tectonic empty stack, initialize the stack)