队列（链表实现）

/* 链表队列
 * front 为队头指针(链表头节点)
 * rear 为队尾指针
 */
#include<stdio.h>
#include<stdlib.h>

typedef struct list_t{
	int _element;
	struct list_t *_next;
}list_t;

/* 要改变一个变量的值，需要传入变量的地址作参数；
 * 要改变一个指针的值，需要传入该指针的地址作参数(即指针的指针)； 
 */
void insertQueue(list_t **front, list_t **rear, int value)
{
	list_t *temp;
	temp = (list_t*)malloc(sizeof(list_t));
	if(temp == NULL) {
		printf("error: malloc\n");
		exit(0);
	}
	temp->_element = value;
	temp->_next = NULL;
	if(*rear == NULL) { //empty queue: front = rear = NULL
		*rear = temp;
		*front = *rear;
	} else {
		(*rear)->_next = temp;
		*rear = temp;
	}
}

void delQueue(list_t **front, list_t **rear, int *value)
{
	list_t *temp;
	if((*front == *rear) && (*rear == NULL)) {
		printf("Queue underflow\n");
		exit(0);
	}
	*value = (*front)->_element;
	temp = *front;
	*front = (*front)->_next;
	if(*rear == temp)
		*rear = (*rear)->_next;
	free(temp);
	
}

void printQueue(list_t *head)
{
	while(head != NULL) {
		printf("%d ", head->_element);
		head = head->_next;
	}
	putchar('\n');
}

void item()
{
    printf("*************** Welcome to the Queue *************\n");
    printf("1: Insert one element;\n");
    printf("2: Delete one element;\n");
    printf("0: Exit.\n");
    printf("*************************************************\n");
    printf("Select your operation: ");
}

main(void)
{
	char item_choice;
	list_t *front = NULL;
	list_t *rear = NULL;
	int n;
	item();
	while(1)
    {
        item_choice = getchar();
        switch (item_choice)
        {
            case '1':
                printf("Insert a element to the queue: ");
                scanf("%d", &n);
                insertQueue(&front, &rear, n);
                printf("\nQueue: ");
                printQueue(front);
                putchar('\n');
                item();
                break;
            case '2':
                printf("Get an element from the queue: ");
                delQueue(&front, &rear, &n);
                printf("Element: %d\n", n);
                printf("Queue: ");
                printQueue(front);
                putchar('\n');
                item();
                break;
            case '0':
                printf("Good luck to you!\n");
                return 0;
        }
    }
    return;
}