연결 리스트 큐 (LinkedList Queue)

#pragma once

struct Node
{
	int data;
	Node* next;

};

class LinkedListQueue
{
private:
	Node* m_front;
	Node* m_tail;
	int m_size;

public:
	LinkedListQueue();
	~LinkedListQueue();

	void EnQueue(int _item);
	int DeQueue();
	int GetSize();
	int GetFront();


};

LinkedListQueue.h

 

 

 

 

 

#include "LinkedListQueue.h"

LinkedListQueue::LinkedListQueue()
{
	m_front = nullptr;
	m_tail = nullptr;
	m_size = 0;

}

LinkedListQueue::~LinkedListQueue()
{
}

void LinkedListQueue::EnQueue(int _item)
{
	Node* temp = new Node;
	temp->data = _item;
	temp->next = nullptr;

	if (!m_tail)
	{
		m_tail = temp;
		m_front = temp;
	}
	else
	{
		m_tail->next = temp;
		m_tail = temp;
	}

	m_size++;

}

int LinkedListQueue::DeQueue()
{
	Node* tempNode;
	int tempData;

	tempData = m_front->data;
	tempNode = m_front;
	m_front = m_front->next;

	delete tempNode;
	m_size--;

	return tempData;

}

int LinkedListQueue::GetSize()
{
	return m_size;

}

int LinkedListQueue::GetFront()
{
	return m_front->data;

}

LinkedListQueue.cpp