Queue_linkedlist2.cpp

#include <cstdlib>
#include <iostream>

using namespace std;

struct Node {
	int data;
	struct Node *next;
};

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

void InitQueue(struct Queue **q) {
	*q = (struct Queue *)malloc(sizeof(struct Queue));
	(*q)->front = (*q)->rear = NULL;
}

void EnQueue(struct Queue **q, int data) {
	struct Node *tmp = (struct Node *)malloc(sizeof(struct Node));
	tmp->data = data;
	tmp->next = NULL;

	if ((*q)->front == NULL) {
		(*q)->front = (*q)->rear = tmp;
		return; 
	}

	(*q)->rear->next = tmp;
	(*q)->rear = tmp;
}

void PrintQueue(struct Queue **q) {
	struct Node *ptr = (*q)->front;
	while (ptr != NULL) {
		cout << ptr->data << ' ';
		ptr = ptr->next;
	}
	cout << '\n';
}

int main(void) {
	struct Queue *q = NULL;

	InitQueue(&q);
	EnQueue(&q, 10);
	EnQueue(&q, 20);
	EnQueue(&q, 30);
	EnQueue(&q, 40);
	EnQueue(&q, 50);
	
	PrintQueue(&q);

	return 0;
}