#ifndef __LINKED_LIST_STACK__
#define __LINKED_LIST_STACK__

template <typename T>
class node
{
public:
	T data;
	node<T>* next;

	node() { next = NULL; }
	node(T elem) { data = elem; next = NULL; }
};

template <typename T>
class LL_Stack
{
private: 
	node<T>* tos;

public:
	LL_Stack() { tos = NULL; }
	~LL_Stack();

	void push(const T& elem);
	T pop();

	bool isEmpty() { return (tos == NULL); }
	bool isFull()
	{
		node<T>* tmp = new node<T>;

		if (tmp == NULL)
			return true;
		delete tmp;

		return false;
	}
};

template <typename T>
void LL_Stack<T>::push(const T& elem)
{
	node<T>* new_node = new node<T>(elem);
	new_node->next = tos;
	tos = new_node;
}

template <typename T>
T LL_Stack<T>::pop()
{
	node<T>* tmp = tos;
	tos = tos->next;   // tmp->next
	T rlt = tmp->data;
	
	if (tmp != NULL)
		delete tmp;
	
	return rlt;
}

template <typename T>
LL_Stack<T>::~LL_Stack()
{
	node<T>* tmp;

	while (tos != NULL)
	{
		tmp = tos;
		tos = tos->next;
		delete tmp;
	}
}

#endif