干货6：链式队

#define TRUE  1
#define FALSE 0

typedef int QueueData;
typedef struct _node
{
	QueueData data;
	struct _node *next;
}Node;

typedef struct _queue
{
	Node *front;
	Node *rear;
}Queue;

// 建队置空
Queue* Create_Queue()
{
	Queue * q = (Queue*)malloc(sizeof(Queue)/sizeof(char));
	if (q == NULL)
	{
		errno = MALLOC_ERROR;
		return NULL;
	}
	
	// 置空队
	q->front = NULL;
	q->rear  = NULL;
	
	return q;
}

//  判队空否
int QueueEmpty (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	
	return q->front == NULL;
}

//  进队
int EnQueue (Queue *q, QueueData x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	Node * node = (Node*)malloc(sizeof(Node)/sizeof(char));
	if (node == NULL)
	{
		errno = MALLOC_ERROR;
		return FALSE;
	}
	node->data = x;
	node->next = NULL;
	
	if (q->front == NULL)
	{
		q->front = node;
		q->rear  = node;
	}
	else
	{
		q->rear->next = node;
		q->rear = node;
	}
	
	return TRUE;
}

//  出队
int DeQueue (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
		
	Node *p = q->front;
	*x = p->data;
	
	q->front = p->next;
	free(p);
	
	if (q->front == NULL)
		q->rear = NULL;
		
	return TRUE;
}

// 取队头
int GetFront (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
		
	*x = q->front->data;
		
	return TRUE;
}

//  队的销毁
int Destroy_Queue (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	int x;
	while (QueueEmpty(q) != TRUE)
	{
		DeQueue(q, &x);
	}
	
	free(q);
	
	return TRUE;
}