#ifndef LINKEDSTACK_H
#define LINKEDSTACK_H

#include "340.h"
#include "SinglyLinkedList.h"

template <class T>
class linkedStack: public SinglyLinkedList<T>
{
public:
	linkedStack() {};
	virtual ~linkedStack() {};
	bool isEmptyStack();
	bool isFullStack();
	void push(const T& newItem);
	nodeSLL<T> * top();
	void pop();

protected:
	int count;
};

/****************************************************************
   FUNCTION:   isEmptyStack()
   ARGUMENTS:  none
   RETURNS:    bool - if true'false empty
   NOTES:      returns true if empty false if full
****************************************************************/ 
template <class T>
bool linkedStack<T>::isEmptyStack() 
{
	return SinglyLinkedList<T>::isEmpty();
}

/****************************************************************
   FUNCTION:   isFullStack()
   ARGUMENTS:  none
   RETURNS:    bool - true/false
   NOTES:      returns true if full
****************************************************************/ 
template <class T>
bool linkedStack<T>::isFullStack()
{
     if (count < 10) return false;
     else return true;
}

/****************************************************************
   FUNCTION:   push()
   ARGUMENTS:  newElment
   RETURNS:    none
   NOTES:      this adds a new element to the list
****************************************************************/ 
template <class T>
void linkedStack<T>::push(const T& newElement)
{
    if (isFullStack() == false)
       { 
       SinglyLinkedList<T>::addToHead(newElement);
	     count++; 
        }
    else 
         cout << "Stack Overflow...\n";
}

/****************************************************************
   FUNCTION:   top()
   ARGUMENTS:  none
   RETURNS:    nodeSLL<T> *
   NOTES:      returns the node at head of list
****************************************************************/ 
template <class T>
nodeSLL<T> * linkedStack<T>::top() 
{
	return SinglyLinkedList<T>::getHead();
}

/****************************************************************
   FUNCTION:   pop()
   ARGUMENTS:  none
   RETURNS:    none
   NOTES:      removes the top node in the head position of list
****************************************************************/ 
template <class T>
void linkedStack<T>::pop()
{
    if (isEmptyStack() == false)
       { CourseInfo temp = top()->info;
         SinglyLinkedList<T>::deleteNode(temp);
	     count--;
      }
    else cout << "Stack Underflow...\n";
}

#endif // END IF LINKEDSTACK.H