队列的C语言实现
- FIFO
- 队头front,队尾tail,大小size
- 操作:入队,出队,获取队头元素,判断是否为NULL
数组队列,链式队列。
链式队列的实现:
#include <stdio.h>
#include<stdlib.h>
/**
* 队列的属性&方法:
* 队首;
* 队尾;
* 元素个数;
* 判空;
* 初始化;
* 入队;
* 出队;
*/
struct Queue{
struct Node* front;
struct Node* tail;
int size;
};
struct Node {
int data;
struct Node* next;
};
//创建节点
struct Node* create_Node(int data){
struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->next = NULL;
newNode->data = data;
return newNode;
}
//判断是否为空队
int isempty(struct Queue* MyQueue){
if(MyQueue->tail==NULL && MyQueue->front==NULL){
return 1;
}return 0;
}
//初始化队列
struct Queue* initial_queue(){
struct Queue* Myqueue = (struct Queue*)malloc(sizeof(struct Queue));
Myqueue->size = 0;
//头等于尾等于NULL
Myqueue->front = Myqueue->tail =NULL;
return Myqueue;
}
//入队
void push_queue(struct Queue* MyQueue,int data){
struct Node* newNode = create_Node(data);
newNode->data = data;
//如果队列为空
if(isempty(MyQueue) == 1){
MyQueue->front = newNode;
MyQueue->tail = newNode;
MyQueue->size++;
printf("新队列插入元素%d成功\n",data);
}else{
MyQueue->tail->next = newNode;
MyQueue->tail = newNode;
MyQueue->size++;
printf("插入元素%d成功\n",data);
}
}
//出队
void pop_queue(struct Queue* MyQueue){
if(isempty(MyQueue) == 1){
printf("队列是空队,不能出队\n");
}else{
MyQueue->front = MyQueue->front->next;
MyQueue->size--;
printf("队首元素出队成功\n");
}
}
int main() {
struct Queue* MyQueue = initial_queue();
push_queue(MyQueue,1);
push_queue(MyQueue,2);
push_queue(MyQueue,3);
push_queue(MyQueue,4);
//实现方法很简单,就不写了
return 0;
}
便于各个方法实现,和理解数据结构。