Stack

Stack) is also a linear structure while the data operations are only admitted in one specific side which is called last-in-first-out, LIFO.

Stack Template Class

#include "vector.h"
template <typename T>
class stack: public vector<T>
{
	public:
		void push (T const& e)
		{
			insert(size(), e);
		}
		T pop()
		{
			return remove(size()-1);
		}
		T & top()
		{
			return (*this)[size()-1];
		}
}