[C++ & 자료구조]리스트기반의 스택

#ifndef LISTBASESTACK_H
#define LISTBASESTACK_H
 
typedef int LData;
 
class Node
{
private:
    LData data;
public:
    Node *next;
 
    Node(LData data):data(data){}
    LData getData(){return data;}
};
 
class ListStack
{
private:
    Node *head;
public:
 
    ListStack()
    {
        head = nullptr;
    }
 
    bool SIsEmpty();
    void SPush(LData data);
    LData SPop();
    LData SPeek();
};
#endif // LISTBASESTACK_H

#include<iostream>
#include"ListBaseStack.h"
using namespace std;
 
bool ListStack::SIsEmpty()
{
    if (head == nullptr)
        return true;
    else
        return false;
}
 
void ListStack::SPush(LData data)
{
    Node *newNode = new Node(data);
 
    newNode->next = head;
    head = newNode;
}
 
LData ListStack::SPop()
{
    LData rdata;
    Node *rnode;
    
    if (SIsEmpty())
    {
        cout << "Stack is empty!" << endl;
        exit(-1);
    }
        
    rdata = head->getData();
    rnode = head;
    head = head->next;
    delete rnode;
    return rdata;
}
 
LData ListStack::SPeek()
{
    if (SIsEmpty())
    {
        cout << "Stack is empty!" << endl;
        exit(-1);
    }
 
    return head->getData();
}
 
int main()
{
    ListStack stack;
 
    stack.SPush(1);
    stack.SPush(2);
    stack.SPush(3);
    
    while (!stack.SIsEmpty())
        cout << stack.SPop() << " ";
 
    return 0;
}