数据结构实验之栈与队列一：进制转换

#include <stdlib.h>
#include <math.h>
//建立节点
typedef struct node
{
    int data;
    struct node *next;
}node ,*pnode;
//建立栈
typedef struct Stack
{
    pnode top;
    pnode bottom;
}Stack ,*pstack;
//栈的初始化
void initstack(pstack s)
{
    s->top=(pnode)malloc(sizeof(node));
    s->bottom=s->top;
    s->top->next=NULL;
    return ;
}
//压栈
void push(pstack s,int e)
{
    pnode p;
    p=(pnode)malloc(sizeof(node));
    p->data=e;
    p->next=s->top;
    s->top=p;
}
//判断栈是否为空
int empty(pstack s)
{
    if(s->top==s->bottom)
        return 1;
    else
        return 0;
}
//出栈
bool  pop(pstack s,int *e)
{
   if(empty(s))
   {
       return false;
   }
   else
   {
       pnode p=s->top;
       *e=p->data;
       s->top=p->next;
       free(p);
       p=NULL;
   }
}
void traverse(pstack s)
{
    pnode p=s->top;
    while(p!=s->bottom)
    {
        printf("%d",p->data);
        p=p->next;
    }
    printf("n");
}
int main()
{
    Stack s;
    initstack(&s);
    int n,m;
    int i;
    scanf("%d %d",&n,&m);
    while(n>=m)
    {
        push(&s,n%m);
        n=n/m;
    }
    push(&s,n);
    int cou;
    traverse(&s);
}
 /*    while(pop(&s,&cou))
        {
            printf("%d",cou);
        }
        printf("n");
}
    if(n==0)
    {
        printf("0n");
    }
    if(n>0)
    {
        for(i=0;n;i++)
        {
            push(&s,n%m);
            n=n/m;
        }
        int c=i;
        int cou;
        while(pop(&s,&cou))
        {
            printf("%d",cou);
        }
        printf("n");
    }
}
*/
/*
int main()
{
    Stack s;
    initstack(&s);
    int i;
    for(i=1;i<=9;i++)
    {
        push(&s,i);
    }
    int cou;
    while(pop(&s,&cou))
    {
        printf("%d ",cou);
    }
}
*/