佇列的鍊錶實現

#include #include using namespace std;

const int maxsize = 10;		//佇列的容量
//單個結點結構體
typedef struct node
pnode;
//佇列結構體
typedef struct queue
pqueue;
//函式實現
//******************************=
//建立空佇列
pqueue *createemptyqueue()
//判斷佇列是否為空
bool isemptyqueue(pqueue *p)
//判斷是否滿佇列
bool isfullqueue(pqueue *p)
//入隊
void pushdatatoqueue(pqueue *p)
//返回隊頭元素並且釋放隊頭結點
int popdatafromqueue(pqueue *p)
//******************************=
int main()

佇列的鍊錶實現！

include include typedef char elemtype typedef struct qnode qnode typedef struct liqueue 初始化佇列 void initqueue liqueue q 判斷是否為空 int queueempty liqueue q...

佇列的鍊錶實現

include include includeconst int max 10 typedef struct node protonode protonode 相當與struct node struct node typedef protonode position position 實際上和 pr...

佇列的鍊錶實現

time 2016 11 29 author yb title queue lian biao ifndef queue h define queue h template class node template class cqueue endif time 2016 11 29 author y...