#include<iostream>
#include<string.h>
#include<stdio.h>
#include<stack>
using namespace std;
template<class T>
class Node{
public:
T data;
Node<T> *link;
};
template<class T>
class LinkedStack{
public:
LinkedStack(){top=0;}
~LinkedStack();
bool IsEmpty() const{return top==0;}
bool IsFull() const;
T Top() const;
LinkedStack<T>& Add(const T& x);
LinkedStack<T>& Delete(T& x);
Node<T> *top;
};
template<class T>
LinkedStack<T>::~LinkedStack(){
Node<T> *next;
while(top){
next = top->link;
delete top;
top = next;
}
}
template<class T>
bool LinkedStack<T>::IsFull() const{
try{Node<T> *p = new Node<T>;
delete p;
return false;}
catch(NoMem){return true;}
}
template<class T>
T LinkedStack<T>::Top() const{
if(IsEmpty()) cout<<"OutofBounds"<<endl;
return top->data;
}
template<class T>
LinkedStack<T>& LinkedStack<T>::Add(const T& x){
Node<T> *p = new Node<T>;
p->data = x;
p->link = top;
top = p;
return *this;
}
template<class T>
LinkedStack<T>& LinkedStack<T>::Delete(T& x){
if(IsEmpty()) cout<<"OutofBounds"<<endl;
x = top->data;
Node<T> *p = top;
top = top->link;
delete p;