數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)——隊(duì)列(附程序)

實(shí)驗(yàn)實(shí)驗(yàn)三三 隊(duì)隊(duì)列列 一 一 實(shí)驗(yàn)實(shí)驗(yàn)?zāi)康哪康?1 了解隊(duì)列的特性 2 掌握隊(duì)列的順序表示和實(shí)現(xiàn) 3 掌握隊(duì)列的鏈?zhǔn)奖硎竞蛯?shí)現(xiàn) 二 二 實(shí)驗(yàn)實(shí)驗(yàn)內(nèi)容內(nèi)容 實(shí)驗(yàn)實(shí)驗(yàn)3 3隊(duì)隊(duì)列的列的順順序表示和序表示和實(shí)現(xiàn)實(shí)現(xiàn) 編寫一個(gè)程序?qū)崿F(xiàn)順序隊(duì)列的各種基本運(yùn)算 采用循環(huán)隊(duì)列 并在此基礎(chǔ)上設(shè)計(jì)一個(gè)主程序 完成如下功能 1 初始化隊(duì)列 2 建立順序隊(duì)列 3 入隊(duì) 4 出隊(duì) 5 判斷隊(duì)列是否為空 6 取隊(duì)頭元素 7 遍歷隊(duì)列 實(shí)驗(yàn)實(shí)驗(yàn)3 4隊(duì)隊(duì)列的列的鏈鏈?zhǔn)奖硎竞褪奖硎竞蛯?shí)現(xiàn)實(shí)現(xiàn) 編寫一個(gè)程序?qū)崿F(xiàn)鏈隊(duì)列的各種基本運(yùn)算 并在此基礎(chǔ)上設(shè)計(jì)一個(gè)主程序 完成如下功能 1 初始化并建立鏈隊(duì)列 2 入鏈隊(duì)列 3 出鏈隊(duì)列 4 遍歷鏈隊(duì)列 include include define MAXQSIZE 100 typedef struct int base int front int rear SqQueue int InitQueue SqQueue if Q base exit 0 Q front Q rear 0 return 0 初始化順序隊(duì)列 int QueueLength SqQueue Q int i i Q rear Q front MAXQSIZE MAXQSIZE printf 隊(duì)列長(zhǎng)度 5d n i if i printf 隊(duì)列非空 else printf 隊(duì)列為空 return 0 判斷隊(duì)列是否為空 int EnQueue SqQueue Q base Q rear e Q rear Q rear 1 MAXQSIZE return 0 將元素e入隊(duì) int DeQueue SqQueue e Q base Q front printf 5d n e Q front Q front 1 MAXQSIZE return 0 刪除元素e并返回其值 int GetHead SqQueue e Q base Q front printf 返回隊(duì)頭元素 5d n e return 0 返回隊(duì)頭元素e void PrintQueue SqQueue printf 順序隊(duì)列中的元素 n for k Q front k Q rear k printf 5d Q base k printf n 遍歷順序隊(duì)列 void main int e i n SqQueue Q InitQueue Q printf 1 元素入隊(duì) 2 元素出隊(duì) 3 返回隊(duì)頭元素 4 隊(duì)列空否0 結(jié)束運(yùn)行 n printf n printf n printf n printf n printf n printf 選擇 scanf d printf n printf n while n 0 switch n case 1 printf 入隊(duì)元素 scanf d EnQueue Q e PrintQueue Q printf n printf n break case 2 printf 出隊(duì)元素 DeQueue Q e PrintQueue Q printf n printf n break case 3 GetHead Q e printf n printf n break case 4 QueueLength Q printf n printf n break printf 選擇 scanf d printf n printf n printf 結(jié)束運(yùn)行 再見 n 鏈?zhǔn)疥?duì)列 include include typedef struct QNode int data struct QNode next QNode QueuePtr typedef struct QueuePtr front 隊(duì)頭指針 QueuePtr rear 隊(duì)尾指針 LinkQueue int InitQueue LinkQueue if Q front exit 0 Q front next NULL return 0 初始化鏈?zhǔn)疥?duì)列 int EnQueue LinkQueue p QueuePtr malloc sizeof QNode if p exit 0 p data e p next NULL Q rear next p Q rear p return 0 在隊(duì)尾插入元素e int DeQueue LinkQueue if Q front Q rear return 0 p Q front next e p data Q front next p next if Q rear p Q rear Q front free p return 0 刪除隊(duì)頭元素e int PrintQueue LinkQueue printf 鏈?zhǔn)疥?duì)列中的元素 if Q front next NULL p Q front next if Q front next NULL do printf 5d p data p p next while p NULL else printf 隊(duì)列為空 n printf n return 0 遍歷鏈?zhǔn)疥?duì)列 void main LinkQueue Q int e m printf n printf n printf n printf n printf 1 插入元素 2 刪除元素 0 結(jié)束運(yùn)行 n printf n printf n printf n InitQueue Q printf n printf n printf 選擇 scanf d printf n printf n while m 0 switch m case 1 printf 插入元素 scanf d EnQueue Q e PrintQueue Q printf n