栈的简单应用-进制转换

余数的序列正好与8进制数字序列相反，利用栈后进先出的特点，用栈来保存

#include <iostream>//带头栈
#include <cstdlib>
using namespace std;
typedef struct node 
{
    int data;
    struct node *next;
}*linkstack,stacknode;
void initstack(linkstack *top)
{
    *top=new stacknode;
    (*top)->next=NULL;
}
bool isempty(linkstack top)
{
    if(top->next==NULL)
        return 1;
    return 0;
}
int pushstack(linkstack top,int num)
{
    linkstack p=new stacknode;
    p->data=num;
    p->next=top->next;
    top->next=p;
}
int popstack(linkstack top)
{
    if(isempty(top)==1)
        return 0;
    linkstack p;
    p=top->next;
    top->next=p->next;
    free(p);
}
int getstack(linkstack top)
{
    if(isempty(top)==1)
        return 0;
    else
        cout<<(top->next)->data<<" ";

}
int clearstack(linkstack top)
{
    top->next=NULL;
}
int main()
{
    int i=0;
    linkstack top;
    initstack(&top);
    int n=1568;
    while(n!=0)
    {
        pushstack(top,n%8);
        n=n/8;
    }
    while(isempty(top)!=1)
    {
        getstack(top);
        popstack(top);
    }
    clearstack(top);
    return 0;
}