一个可以读取Access数据库表的简单实例.可应用于办公室系统中....

这个是数据结构中一定有的哈夫曼的实验-this is the data structure will have to Huffman experiments

#include #include struct BiTNode           //定义二叉树结构体 {   float data;   struct BiTNode *lchild;   struct BiTNode *rchild; }; //二叉树创建函数 struct BiTNode *CreateTree(float *preorder,float *inorder,int lenth) {     float *p,*q;      

用C++实现二叉树的建立，删除，添加。主要使用的是类的结构。-C realization of the establishment of binary tree, delete, add. The main category is the use of the structure.

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code

数据结构中最经常用到的，包括链表、双链表、二叉树、平衡二叉树、哈希表等-Data structure the most frequently used, including the list, double linked lists, binary tree, balanced binary tree, hash table, etc.

数据结构c++版程序-data structure c editions

一个商品销售系统-a sales system

基于VISAUL C++开发的 关键路径求解 属于数据结构-Based on VISAUL C++ Developed to solve the critical path data structure belonging to

Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!