數(shù)據(jù)結(jié)構(gòu)算法習(xí)題答案帶頭結(jié)點(diǎn)的循環(huán)鏈表表示隊(duì)列,并且只設(shè)一個(gè)指針指向隊(duì)尾元素結(jié)點(diǎn)注意不設(shè)頭指針

1、For pers onal use only in study and research; not for commercial use數(shù)據(jù)結(jié)構(gòu)算法題（假設(shè)以帶頭結(jié)點(diǎn)的循環(huán)鏈表表示隊(duì)列，并且只設(shè)一個(gè)指針指向隊(duì)尾元素結(jié)點(diǎn)（注意不設(shè)頭指針）試編寫相應(yīng)的隊(duì)列初始化，入隊(duì)列和出隊(duì)列的算法!）（提供兩種答案哦！ ?。?既然是算法就不用源碼了具體看注釋typedef int Datatype;typedef struct queue nodeDatatype data; struct queue node *n ext;QueueNode; /以上是結(jié)點(diǎn)類型的定義typedef structqueue n

2、ode rear;Lin kQueue; /只設(shè)一個(gè)指向隊(duì)尾元素的指針void In itQueue( Lin kQueue &Q)/置空隊(duì)：就是使頭結(jié)點(diǎn)成為隊(duì)尾元素Q.rear=(queue no de*)malloc(sizeof(queue no de)QueueNode* s;Q-rear = Q-rear- next;/將隊(duì)尾指針指向頭結(jié)點(diǎn)while(Q-rear!=Q-rear- next)/當(dāng)隊(duì)列非空，將隊(duì)中元素逐個(gè)出隊(duì)s=Q-rear- n ext;Q-rear- n ext=s-n ext; free(s); /回收結(jié)點(diǎn)空間int EmptyQueue( LinkQu

3、eue &Q) /判隊(duì)空/當(dāng)頭結(jié)點(diǎn)的next指針指向自己時(shí)為空隊(duì)returnQ-rear-next-next=Q-rear-next;void EnQueue( LinkQueue &Q, Datatype x) /入隊(duì)/也就是在尾結(jié)點(diǎn)處插入元素QueueNode *p=(QueueNode *) malloc (sizeof(QueueNode);/申請新結(jié)點(diǎn)p-data=x; p-next=Q-rear-next;/初始化新結(jié)點(diǎn)并鏈入Q-rear-next=p;Q-rear=p;/將尾指針移至新結(jié)點(diǎn)Datatype DeQueue( LinkQueue &Q,Dat

4、atype &x)/出隊(duì),把頭結(jié)點(diǎn)之后的元素摘下Datatype t;QueueNode *p; if(EmptyQueue( Q )Error(Queue underflow);p=Q-rear-next-next; /p指向?qū)⒁碌慕Y(jié)點(diǎn)x=p-data; /保存結(jié)點(diǎn)中數(shù)據(jù)if(p=Q-rear) /當(dāng)隊(duì)列中只有一個(gè)結(jié)點(diǎn)時(shí)，p結(jié)點(diǎn)出隊(duì)后， 要將隊(duì)尾指針指向頭結(jié)點(diǎn)Q-rear = Q-rear-next; Q-rear-next=p-next;elseQ-rear-next-next=p-next;/摘下結(jié)點(diǎn)p free(p);/釋放被刪結(jié)點(diǎn)return x;typedef stru

5、ct Nodeint data;struct Node *n ext;Node,*CiLNode;typedef structCiLNode CiLrear;CiQueue;void InitCiQueue(CiQueue &Q)初始化循環(huán)鏈表表示的隊(duì)列QQ=(CiLNode*)malloc(sizeof(CiLNode);Q- next=Q;/lni tCiQueuevoid EnCiQueue(CiQueue &Q,int x)/把元素x插入循環(huán)鏈表表示的隊(duì)列Q,Q指向隊(duì)尾元素,Q-next指向頭結(jié)點(diǎn),Q-next-next指向隊(duì)頭元素p=(CiLNode*)malloc(

6、sizeof(CiLNode);p_data=x;p-next=Q-next; /直接把p加在Q的后面Q_n ext=p;Q=p; /修改尾指針Status DeCiQueue(CiQueue &Q,int x)/從循環(huán)鏈表表示的隊(duì)列Q頭部刪除元素xif(Q=Q- next) return INFEASIBLE; /隊(duì)列已空p=Q-n ext- n ext;x=p-data;Q-n ext- n ext=p-n ext;free(p);return OK;/DeCiQueue僅供個(gè)人用于學(xué)習(xí)、研究；不得用于商業(yè)用途。For personal use only in study and

7、research; not for commercial use.Nur fur den pers?nlichen fur Studien, Forschung, zu kommerziellen Zwecken verwendet werden.Pour l etude et la recherche uniquementades fins personnelles; pasades fins commerciales.ToJI E Kogfljirogeifcc,TOpBicnob3 groimio麻yqeHuicic碼egoBua H Hedo員冶HBIucno員B30BaTbCEB.KoMMepqeckux qeiix-以下無正文-僅供個(gè)人用于學(xué)習(xí)、研究；不得用于商業(yè)用途。For personal use only in study and research; not for commercial use.Nur fur den pers?nlichen fur Studien, Forschung, zu kommerziellen Zwecken verwendet werden.Pour l etude et la recherche uniquementades fins personnelles; pasades fins