佇列鏈式儲存

#ifndef status_h

#define status_h
#define false -1
#define true 1
#define ok 1
#define error 0
typedef
int elemtype;
typedef
int status;
#endif

#ifndef stack_h

#define stack_h
#include
#include
"status.h"
typedef
struct nodedl,
*list;
status initnode
(dl *s)
;//初始化 
status pushnode
(dl *s,elemtype e)
;//插入資料 
status popnode
(dl *s,elemtype *e)
;//彈出對頭元素 
//status shows(dl *s);//遍歷資料 
status isemptynode
(dl *s)
;//判斷佇列是否為空 
#endif

#include

#include
"stack.h"
#include
"status.h"
status initnode
(dl *s)
else
} status pushnode
(dl *s,elemtype e)
status popnode
(dl *s,elemtype *e)
status isemptynode
(dl *s)

#include

#include
"stack.h"
intmain()
else
printf
("鏈式隊列為空\n");
printf
("請輸入插入的節點個數：");
scanf
("%d"
,&n)
;while
(i<=n)
t=pushnode
(s,&value);;
if(t==ok)
else
printf
("入隊失敗\n");
q=popnode
(s,&value);if
(q==ok)
printf
("鏈式佇列隊頭為：%d"
,value)
;printf
("\n");
m=isemptynode
(s);
if(m==true)
else
}

佇列的鏈式儲存

include include include typedef int elemtype typedef struct qnodequeuenode,queuenodeptr typedef struct qlistlistqueue,listqueueptr listqueueptr initqu...

佇列的鏈式儲存

include include 經典的佇列，使用鏈式儲存實現 佇列的基本特點就是一端是執行出列操作，一端是執行入列操作 typedef struct nodenode typedef structqueue void outqueue queuep myqueue void displayqueue...

佇列的鏈式儲存

基於以前的線性表實現，線性表見 linkqueue.件 include stdio.h include stdlib.h include linklist.h typedef void linkqueue typedef struct tag linkqueuenode tlinkqueuenode...