这是数据结构算法中的栈的实现的源码。用C++开发。

睿网留言版 2004 v1.0-network message boards No. 2004 v1.0

数据库基础教程chm-database based tutorial chm

企业客户关系管理系统-Enterprise Customer Relationship Management System

单连表的建立与添加,删除操作.希望能帮帮忙!-single table even with the establishment add, delete operation. Hope can help help!

PB制作时钟小程序-PB produced small clock procedures

用C语言实现的各种算法及演示，可以结合代码分步观看执行过程-C language algorithms and the various presentations, combining code can watch the step-by-step implementation process

站长以前写的informix通用开发包源码，用c和ec编写-common code for infomrix,c and ec

计算机销售系统 一个不错的程序-computer sales system a good procedure

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());