数据结构8，链队列

1.链队列定义

队列是一种先进先出的结构，只允许在一端进行插入数据操作，在另一端进行删除数据操作的特殊线性表，比如生活当中的排队，队列需要有头有尾。

链队列就是用链表来实现队列，所以初始化链队列时要有两个指针，一个表示头一个表示尾。

2.代码

//链队列
#include<stdio.h>
#include<malloc.h>

/**
 *链队列的节点。
 */
 typedef struct LinkNode
 {
	int data;
	LinkNode* next;
}*LinkNodePtr;

/**
 * 链队列.
 */
typedef struct LinkQueue
{
	LinkNodePtr front;
	LinkNodePtr rear; 
}*LinkQueuePtr;

/**
 *函数申明 
 */
LinkQueuePtr initQueue();
void outputLinkQueue(LinkQueuePtr paraQueuePtr);
void enqueue(LinkQueuePtr paraQueuePtr, int paraElement);
int dequeue(LinkQueuePtr paraQueuePtr);
void testLinkQueue();
/**
 *Construct an empty queue.
 */
LinkQueuePtr initQueue()
{
	LinkQueuePtr resultPtr = (LinkQueuePtr)malloc(sizeof(struct LinkQueue));
	//The header, the data is not useful.
	LinkNodePtr headerPtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	headerPtr->next = NULL;
	
	resultPtr->front = headerPtr;
	resultPtr->rear = headerPtr;
	
	return resultPtr;
}//of initQueue

void outputLinkQueue(LinkQueuePtr paraQueuePtr
){
	LinkNodePtr tempPtr = paraQueuePtr->front->next;
	while (tempPtr != NULL) 
	{
		printf("%d ", tempPtr->data);
		tempPtr = tempPtr->next;
	}//Of while
	printf("\n");
}//Of outputLinkQueue


/**
 * Enqueue.
 */
void enqueue(LinkQueuePtr paraQueuePtr, int paraElement)
{
	//step1.Create a new node.
	LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	tempNodePtr->data = paraElement;
	tempNodePtr->next = NULL;
	
	//step2.Link to the existing rear.
	paraQueuePtr->rear->next = tempNodePtr;
	
	//step3.It is the new rear.
	paraQueuePtr->rear = tempNodePtr;
}//of enqueue

/**
 *Dequeue.
 *@return The value of the header.
 */
int dequeue(LinkQueuePtr paraQueuePtr)
{
	int resultValue;
	LinkNodePtr tempNodePtr;
	
	//step1.Is the queue empty?
	if(paraQueuePtr->front == paraQueuePtr->rear)
	{
		printf("The queue is empty.\n");
		return -1;
	}//of if
	
	//step2.Change the queue.
	tempNodePtr = paraQueuePtr->front->next;
	resultValue = tempNodePtr->data;
	paraQueuePtr->front->next = paraQueuePtr->front->next->next;
	
	if(paraQueuePtr->rear == tempNodePtr)
	{
		paraQueuePtr->rear = paraQueuePtr->front;
	}//of if
	
	//step3.Free space.
	tempNodePtr = NULL;
	
	//step4.Return.
	return resultValue;
}//of dequeue

/**
 *Unit test.
 */
void testLinkQueue()
{
	LinkQueuePtr tempQueuePtr;
	tempQueuePtr = initQueue();
	enqueue(tempQueuePtr, 10);
	enqueue(tempQueuePtr, 30);
	enqueue(tempQueuePtr, 50);

	outputLinkQueue(tempQueuePtr);
	
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	
	enqueue(tempQueuePtr, 8);
	outputLinkQueue(tempQueuePtr);
}//of testLinkQueue

/**
 *The entrance.
 */
int main()
{
	testLinkQueue();
	return 1;
}//of main

 链队列初始化

LinkQueuePtr initQueue()
{
	LinkQueuePtr resultPtr = (LinkQueuePtr)malloc(sizeof(struct LinkQueue));
	//The header, the data is not useful.
	LinkNodePtr headerPtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	headerPtr->next = NULL;
	
	resultPtr->front = headerPtr;
	resultPtr->rear = headerPtr;
	
	return resultPtr;
}//of initQueue

链队列遍历 

 

void outputLinkQueue(LinkQueuePtr paraQueuePtr
){
	LinkNodePtr tempPtr = paraQueuePtr->front->next;
	while (tempPtr != NULL) 
	{
		printf("%d ", tempPtr->data);
		tempPtr = tempPtr->next;
	}//Of while
	printf("\n");
}//Of outputLinkQueue

链队列入队 

void enqueue(LinkQueuePtr paraQueuePtr, int paraElement)
{
	//step1.Create a new node.
	LinkNodePtr tempNodePtr = (LinkNodePtr)malloc(sizeof(struct LinkNode));
	tempNodePtr->data = paraElement;
	tempNodePtr->next = NULL;
	
	//step2.Link to the existing rear.
	paraQueuePtr->rear->next = tempNodePtr;
	
	//step3.It is the new rear.
	paraQueuePtr->rear = tempNodePtr;
}//of enqueue

链队列出队 

int dequeue(LinkQueuePtr paraQueuePtr)
{
	int resultValue;
	LinkNodePtr tempNodePtr;
	
	//step1.Is the queue empty?
	if(paraQueuePtr->front == paraQueuePtr->rear)
	{
		printf("The queue is empty.\n");
		return -1;
	}//of if
	
	//step2.Change the queue.
	tempNodePtr = paraQueuePtr->front->next;
	resultValue = tempNodePtr->data;
	paraQueuePtr->front->next = paraQueuePtr->front->next->next;
	
	if(paraQueuePtr->rear == tempNodePtr)
	{
		paraQueuePtr->rear = paraQueuePtr->front;
	}//of if
	
	//step3.Free space.
	tempNodePtr = NULL;
	
	//step4.Return.
	return resultValue;
}//of dequeue

测试 

 

void testLinkQueue()
{
	LinkQueuePtr tempQueuePtr;
	tempQueuePtr = initQueue();
	enqueue(tempQueuePtr, 10);
	enqueue(tempQueuePtr, 30);
	enqueue(tempQueuePtr, 50);

	outputLinkQueue(tempQueuePtr);
	
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	printf("Dequeue gets %d.\n", dequeue(tempQueuePtr));
	
	enqueue(tempQueuePtr, 8);
	outputLinkQueue(tempQueuePtr);
}//of testLinkQueue

 

3.运行结果