数据结构之栈的应用之数制转化

#include<stdio.h>
#include<stdlib.h>
#define Stack_Init_Size 100 //栈容量
#define StackIncrement 10 //栈增量
#define OVERFLOW -1
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;
typedef int SElemType;
typedef int Status;
typedef struct SNode {
	SElemType data;
	struct  SNode* next;
}SNode, * LinkStack;
LinkStack InitStack()//注意这个初始化方式！！！！！！
{
	LinkStack s = (SNode*)malloc(sizeof(SNode));
	if (!s)
		exit(OVERFLOW);
	s->next = NULL;
	return s;
}
void Push(LinkStack s, SElemType e)
{
	LinkStack p = (SNode*)malloc(sizeof(SNode));
	if (p == NULL)
		exit(OVERFLOW);
	p->data = e;
	p->next = NULL;
	p->next = s->next;
	s->next = p;//与单链表的头插法相似
}
SElemType Pop(LinkStack s)
{
	LinkStack q;
	q = s->next;
	SElemType e = q->data;
	s->next = q->next;
	free(q);//删除单链表的第一个元素
	return e;
}
void DestroyStack(LinkStack s)
{
	free(s);
}
void ClearStack(LinkStack s)
{
	s->next = NULL;
}
Status StackEmpty(LinkStack s)
{
	if (s->next == NULL)
		return TRUE;
	else
	{
		return FALSE;
	}
}
int StackLength(LinkStack s)
{
	int i = 0;
	SNode* p = s->next;
	while (p != NULL)
	{
		i++;
		p = p->next;
	}
	return i;
}
SElemType GetTop(LinkStack l)
{
	return l->next->data;
}
void StackTravers(LinkStack s)
{
	SNode* p = s->next;
	while (p != NULL)
	{
		printf("%d ", p->data);
		p = p->next;
	}
}
void conversion()//10进制数N转换成8进制数的算法
{
	LinkStack s=InitStack();
	int N,e;
	scanf("%d", &N);
	while (N)
	{
		Push(s, N % 8);
		N = N / 8;
	}
	while (!StackEmpty(s))
	{
		e = Pop(s);
		printf("%d\n", e);
	}
}
int main()
{
	conversion();
	return 0;
}