큐를 구현하시오(배열, 환형큐, 연결리스트)

소개글

큐를 구현하시오(배열, 환형큐, 연결리스트)에 대한 보고서 자료입니다.

본문내용

include < stdio.h >
#include < string.h >
#include
struct queue {
char data;
struct queue *next;
};
struct queue *head;
int addq(char n)
{
struct queue *q, *tmp;
q = (struct queue*)malloc(sizeof(struct queue));
if( !q ) {
printf(\"memory allocation error\\n\");
}
q->data = n;
q->next = NULL;
if( head == NULL ) {
head = q;
} else {
tmp = head;
while( tmp->next ) tmp = tmp->next;
tmp->next = q;
}
return 0;
}
struct queue *deleteq()
{
struct queue *q;
q = head;
head = head->next;
return q;
}
void ShowQ()
{
struct queue *q = head;
printf(\"QUEUE : \");
if( q == NULL )
printf(\"queue empty\");
else{
while( q ) {
printf(\"%c\",q->data);
if( q->next ) printf(\" \");
q = q->next;
}
}
printf(\"\\n\");
}
void main()
{
struct queue *q;
ShowQ();
printf(\"In A\\n\");
addq(\'A\');
ShowQ();
printf(\"In B\\n\");
addq(\'B\');
ShowQ();
printf(\"Out\\n\");
q = deleteq(); free(q);
ShowQ();
printf(\"Out\\n\");
q = deleteq(); free(q);
ShowQ();
printf(\"Out\\n\");
q = deleteq(); free(q);
ShowQ();
printf(\"In C\\n\");
addq(\'C\');
ShowQ();
printf(\"In D\\n\");
addq(\'D\');
ShowQ();
printf(\"In E \\n\");
addq(\'E\');
ShowQ();
printf(\"In F\\n\");
addq(\'F\');
ShowQ();
printf(\"In G\\n\");
addq(\'G\');
ShowQ();
printf(\"In H\\n\");
addq(\'H\');
ShowQ();
}

키워드

큐,   배열,   환형큐,   연결리스트