實(shí)驗(yàn)九 鏈隊(duì)列

實(shí)驗(yàn)九鏈隊(duì)列1.創(chuàng)建一個(gè)包含數(shù)字元素的鏈隊(duì)列，同時(shí)具有如下功能：【1】初始化一個(gè)鏈隊(duì)列【2】輸出鏈隊(duì)列中各結(jié)點(diǎn)的值【3】判斷當(dāng)前鏈隊(duì)列是否為空【4】給出當(dāng)前的隊(duì)列頭元素【5】在鏈隊(duì)列中插入值為x的新元素【6】在鏈隊(duì)列中出隊(duì)列操作并打印被刪除的元素提示：第一步：定義該鏈隊(duì)列的存儲(chǔ)結(jié)構(gòu)（元素都是整型數(shù)字）第二步：定義5種操作的函數(shù)第三步：編寫main函數(shù)。使用switch函數(shù)，根據(jù)用戶的輸入，實(shí)現(xiàn)鏈隊(duì)列相應(yīng)的基本操作。2.選做實(shí)驗(yàn)：把第1題中的數(shù)字元素改為學(xué)生信息表中的信息（學(xué)號(hào)，姓名，成績(jī)）同時(shí)具有上面的5種功能。#include<stdio.h>#include<stdlib.h>typedefstructqnode{intdata;structqnode*next;}linkqlist;typedefstruct{linkqlist*front;linkqlist*rear;}linkqueue;linkqueue*init(){linkqueue*p;linkqlist*s;p=(linkqlist*)malloc(sizeof(linkqlist));s=(linkqlist*)malloc(sizeof(linkqlist));p->front=s;p->rear=p->front;p->front->next=NULL;returnp;}intempty(linkqueue*q){intv;if(q->front==q->rear)v=1;elsev=0;returnv;}intenqueue(linkqueue*q,inte){linkqlist*p;p=(linkqlist*)malloc(sizeof(linkqlist));p->data=e;p->next=NULL;q->rear->next=p;q->rear=p;}voidvisit(linkqueue*p){linkqlist*q;q=p->front->next;printf("displaythelinklist:\n");if(p->front==p->rear)printf("thelinklistisempty!");else{while(q){printf("%d->",q->data);q=q->next;}}printf("\n");}intgethead(linkqueue*q){intv;if(q->front==q->rear)v=-1;elsev=q->front->next->data;returnv;}intdequeue(linkqueue*q){linkqlist*p;inte;if(q->front==q->rear)printf("thelinklistisempty");elsep=(q->front)->next;(q->front)->next=p->next;e=p->data;if(q->rear==p)q->rear=q->front;free(p);returne;}main(linkqueue*head){intn,i,y;intselect;inta,x1,x3,x5,e;printf("createaemptylinkqlist\n");head=init();printf("pleaseinputlinkqlistlength:\n");scanf("%d",&n);for(i=1;i<=n;i++){printf("pleaseinputlinkqlistvalue\n");scanf("%d",&a);enqueue(head,a);printf("select1---visit()\n");printf("select2---empty()\n");printf("select3---gethead()\n");printf("select4---enqueue()\n");printf("select5---dequeue()\n");printf("pleaseselect(1--5):");scanf("%d",&select);switch(select){case1:{visit(head);break;}case2:{x1=empty(head);if(x1==1)printf("thelinkqueueisempty!");elseprintf("thelinkqueueisnotempty");break;}case3:{x3=gethead(head);printf("head->front->%d\n",x3);break;}case4:{printf("pleaseinsertthevalue:");scanf("%