数据结构C语言链栈

#include<stdio.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
typedef int SElemType ;

typedef struct  SNode{

   SElemType data;
   struct SNode *next;

}StackNode,*LinkStack;

//初始化

void Init_Stack_L(LinkStack L){
   
	L=(StackNode*)malloc(sizeof(StackNode));
	L->next=NULL;
}

//Push:入栈
int Push(LinkStack &L,SElemType e){

	LinkStack p;
	p=(StackNode*)malloc(sizeof(StackNode));
	if(p==NULL)  return ERROR;
	p->data=e;
	p->next=L; 
	L=p;
    return OK;
}
int Pop(LinkStack &L,SElemType &e)
{
	LinkStack p=L;
	L=p->next;
	e=p->data;
	free(p);
	return OK;

}
/*void Print(LinkStack &L) {

	int e;
	LinkStack p=L;
    while(p)
	{		
		printf("%3d",p->data);
		p=p->next;
	}
	printf("\n");

}*/
void main() 
{
	LinkStack L;
	int e;
	Init_Stack_L(L);
	Push(L,1);
	Push(L,2);
	Push(L,3);
	Pop(L,e);
	printf("%d\n",e);
	Pop(L,e);
	printf("%d\n",e);
	
  
}