목차
리스트 큐 소스
본문내용
#include
#include
#define MAX_QUEUE 10
#define IS_EMPTY(ptr)(!(ptr))
#define IS_FULL(ptr)(!(ptr))
typedef struct {
int key;
}element;
typedef struct queue *queue_pointer;
typedef struct queue {
element item;
queue_pointer link;
};
void add(queue_pointer *front, queue_pointer *rear, element item){
queue_pointer temp = (queue_pointer) malloc(sizeof(queue));
if(IS_FULL(temp)) fprintf(stderr,"the memory is full\n");
else{
temp->item = item;
temp->link = NULL;
if(*front)
(*rear)->link=temp;
else
*front=temp;
*rear = temp;
}
}
#include
#define MAX_QUEUE 10
#define IS_EMPTY(ptr)(!(ptr))
#define IS_FULL(ptr)(!(ptr))
typedef struct {
int key;
}element;
typedef struct queue *queue_pointer;
typedef struct queue {
element item;
queue_pointer link;
};
void add(queue_pointer *front, queue_pointer *rear, element item){
queue_pointer temp = (queue_pointer) malloc(sizeof(queue));
if(IS_FULL(temp)) fprintf(stderr,"the memory is full\n");
else{
temp->item = item;
temp->link = NULL;
if(*front)
(*rear)->link=temp;
else
*front=temp;
*rear = temp;
}
}