数据结构----循环队列

相对于顺序队列，循环队列遍历更加方便

#include

#include

typedef struct Node {

int Data;

struct Node *next;

} R_LNode, *RLinklist;

RLinklist Create_Linklist(){

RLinklist Head;

Head = (RLinklist)malloc(sizeof(R_LNode));

if(Head){

Head->next = Head;

}

return Head;

}

int Is_Empty(RLinklist Head){

if(Head->next==Head){

printf("空表\n");

return 0;

}

else

return 1;

}

void Insert_Linklist(RLinklist Head,int Data){

RLinklist temp = (RLinklist)malloc(sizeof(R_LNode));

temp->Data = Data;

temp->next = Head->next;

Head->next = temp;

}

//再遍历到头部

void Foreach_Linklist(RLinklist Head){

RLinklist temp = Head->next;

while(temp!=Head){

printf("%d\n",temp->Data);

temp = temp->next;

}

}

int main(void) {

RLinklist Head = Create_Linklist();

printf("%d\n",Is_Empty(Head ));

Insert_Linklist(Head,3);

Insert_Linklist(Head,4);

Insert_Linklist(Head,5);

Foreach_Linklist(Head);

}

转了请标注