연결 리스트 스택 (Linked List Stack)

#pragma once

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

class LinkedListStack
{
private:
	Node* m_top;

public:
	LinkedListStack();
	~LinkedListStack();

	void Push(int _item);
	int Pop();
	bool IsEmpty();
};

LinkedListStack.h

 

 

 

 

 

 

#include "LinkedListStack.h"

LinkedListStack::LinkedListStack() : m_top(nullptr)
{
}

LinkedListStack::~LinkedListStack()
{
}

void LinkedListStack::Push(int _item)
{
	Node* temp = new Node;
	temp->data = _item;
	temp->next = m_top;

	m_top = temp;

}

int LinkedListStack::Pop()
{
	int tempData = m_top->data;
	Node* tempNode = m_top;
	m_top = m_top->next;
	delete tempNode;

	return tempData;

}

bool LinkedListStack::IsEmpty()
{
	return m_top == nullptr;

}

LinkedListStack.cpp