Stos

#include<iostream>
#include<conio.h>
using namespace std;

template <class T>
struct node
{
       node* prev;
       T     val;
};      

template <class T>
class Stack
{
	public:
		node<T> *top;   
		Stack();
		Stack(const Stack& A);
		~Stack();
		void   Push(T a);
		T      Pop();
		void   Show();     
		Stack<T>& operator+(T const & A);
};

template <class T> Stack<T>::Stack()
{ 	
	cout<<"Konstruktor\n";
	top=NULL;
}

template <class T> 
Stack<T>::Stack(const Stack& A)
{	cout<<"\nCopy:\n";
	top=NULL;
	node<T>* wsk=A.top;
	while(wsk)
	{
        this->Push(wsk->val);
        wsk=wsk->prev;
	}      
}

template <class T> Stack<T>::~Stack()
{
	cout<<"Destruktor\n";
	node<T> *wsk=top;
	node<T> *tmp;

	while(wsk)
	{
		tmp=wsk->prev;
		delete wsk;
		wsk=tmp;
    }
}

template <class T> void Stack<T>::Push(T a)
{ 
    node<T>* nowy=new node<T>;
	nowy->val=a;
	nowy->prev=NULL;
	if(!top)	top=nowy;
	else
	{
        node<T>* wsk=top;
 		while(wsk->prev)
		{
			wsk=wsk->prev;
		}
		nowy->prev=top;
		top=nowy;		 
	}
}

template <class T> 
Stack<T>& Stack<T>::operator+(T const & A)
{
         this->Push(A);
}

template <class T> T Stack<T>::Pop()
{
	node<T> *wsk=top;
	T		tmp;
	if(!top)	cout<<"Stos pusty\n";
	else
	{
		top=top->prev;
		tmp=wsk->val;
		delete wsk;
	}
	return tmp;
}

template <class T> void Stack<T>::Show()
{ 
    node<T>* wsk=top;
	if(!top) cout<<"Pusto...\n";
    else
    {	
        cout<<"Na Stosie: \n";
        while(wsk)
		{
			cout<<wsk->val<<"\n";
            wsk=wsk->prev;
		}
    }
}

int main()
{
    Stack<char> A;
    A.Push('a');  A.Push('b');     
    A.Push('c');  A.Show();

    Stack<float> B;
    B.Push(5.5);     B.Push(3.3);
    B.Push(4.4);     B.Show();
    cout<<"\nUsuwam ze Stosu: "<<B.Pop()<<endl;     
    cout<<"\n";      B.Show();

    Stack<char> C(A);
    C+('X');
    C.Show();

    getch();
    return 0;
}