数据结构—队列

#include <iostream>
#include <list>
using namespace std;
struct Node
{
	int data;
	Node* next;
};

Node* initQueue()
{
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = 0;
	node->next = nullptr;
	return node;
}

int isEmpty(Node* stack)
{
	if (stack->data == 0 || stack->next == nullptr)
	{
		return 1;
	} 
	return 0;
}
void push(Node* queue, int data)
{
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = data;
	node->next = NULL;

	Node* head = queue;
	while (queue->next != nullptr)
	{
		queue = queue->next;
	}
	queue->next = node;
	head->data++;
}

Node* pop(Node* queue)
{
	if (queue->next == NULL)
		return NULL;
	Node* node = queue->next;
	queue->next = node->next;
	queue->data--;
	return node;
}


void printStack(Node* node)
{
	cout << "size:" << node->data << endl;
	Node* head = node;
	while (node->next != nullptr)
	{
		node = node->next;
		cout << node->data << endl;
	}
	cout << "null" << endl;
}

int main()
{
	Node* queue = initQueue();
	push(queue, 1);
	push(queue, 2);
	push(queue, 3);
	push(queue, 4);
	push(queue, 5);
	printStack(queue);

	Node* node = pop(queue);
	cout << "pop:" << node->data << endl;

	node = pop(queue);
	cout << "pop:" << node->data << endl;

	node = pop(queue);
	cout << "pop:" << node->data << endl;

	printStack(queue);

	system("pause");
}