Pila Linkata, Esericizo completo

#include "Cpilalinkata.h"

void Pila::push(const T & e){

Record * temp=new Record;

temp->next=l;

temp->elem=e;

l=temp;

}

void Pila::pop(T& e){

Record * temp=l;

l=l->next;

e=l->elem;

delete temp;

}

void Pila::top(T& e)const{

e=l->elem;

}

ostream & operator<<(ostream & os, const Pila & P){

Record * ptr;

ptr=P.l;

while(ptr){

cout<<ptr->elem;

ptr=ptr->next;

}

return os;

}

//Predicati

bool Pila::empty()const{

return l==0;

}

bool Pila::full()const{

return false;

}

Pila::~Pila() {

Record * temp;

while(l){

temp=l;

l=l->next;

delete temp;

}

}