二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。...

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

本程序是一个用于管理学生成绩例子．通过利用MFC的DAO类，用VC++编写独立与DBMS的应用程序-this is a procedure for the management of the performance of their students examples. Through the use of the MFC DAO category, prepared by VC independence and DBMS applications

vc中利用ado访问Access文件（包含tree，datagrid控件）-vc use ado visit Access document (containing tree, datagrid control)

这个是快速排序法的算法实现-This is a rapid method of sorting algorithm

oracle数据库管理员指南知道学习数据库 -oracle database administrators know the study guide to the database

用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it

利用MD5函数产生随机的无碰撞的像素选择策略-The use of MD5 function produces a random collision-free pixel selection strategy

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

声明结构 体，该结构体包含一个值，和一个指向下一个结点的指针next,初始化时头结点指针指向自身，每增加一个节点，使加入的结点的next指针指向头结点，使t头结点的next指针指向插入结点。 源代码 在vs2012 运行通过，界面使用菜单进行操作选择，友好方便，值得参考

自创的彼此交流账目软件，难得的好软件请一定要下来看看。-self-exchange accounts software, a rare good software must please look down.