typedef int element; typedef struct QueueNode { element data; struct QueueNode* link; } QueueNode; typedef struct { QueueNode* front, * rear; }LinkedQueueType; int is_empty(LinkedQueueType *q) { if (q->front = q->rear) { return 1; } else { return 0; } } int is_full(LinkedQueueType *q) { q->rear = q->rear + 1 % MAX_QUEUE_SIZE; if (q->rear = q->front) { return 1; } else { return 0; } } void enqueu..