Guia pila

Estructura de datos - Guía estructura de datos pila

#include <iostream>
#include <conio.h>
#include <stdio.h>
#include <windows.h>

using namespace std;

structpila{
int num;
struct pila *ant;
}*p;

//************************************************************************
void apilar(int a, struct pila *&p){
struct pila *e;e = (struct pila *) malloc (sizeof(struct pila));

if (e == NULL){
cout<<"no hay memoria disponible"<<endl;
}else{
e->num =a;
e->ant = NULL;

if (p == NULL){
p = e;
}else{
e->ant = p;
p = e;
}}
}
//************************************************************************
void insertar(int numero, struct pila *&p){
int n;
while (numero > 1){
n = numero%2;if (numero > 3){
apilar(n,p);
numero = numero/2;
}else{
numero = numero/2;
apilar(n,p);apilar(numero,p);
}
}
}
//************************************************************************
void desapilar(struct pila *&p){
struct pila *aux;if (p != NULL){
aux = p->ant;
free(p);
p = aux;
}else{
cout<<"pila vacía"<<endl;
}
}//***********************************************************************
void resultado(struct pila *&p){

if (p != NULL){
cout<<" resultado: "<<endl;
cout<<""<<endl;
while (p != NULL){
cout<<p->num;
desapilar(p);
}
}else{...