链栈的初始化，压栈，弹栈（C语言）

#define _CRT_SECURE_NO_WARINING
#include <stdio.h>
#include <stdlib.h>


typedef struct StackNode {
	int data;
	struct StackNode* next;

}StackNode,*LinkList;

int InitStack(LinkList L)
{
	L = NULL;
	return 1;
}

int Push(LinkList S, int a)
{
	StackNode *p;
	p = (LinkList)malloc(sizeof(StackNode));
	scanf_s("%d", &a);
	p->data = a;
	p->next = S;
	S = p;
	return S;
}

int Pop(LinkList S, int* b)
{
	StackNode* p;
	if (S == NULL) return 0;
	b = S->data;
	p = S;
	S = S->next;
	free(p);
	
	return b;

}

int main()
{
	int e=0;
	LinkList L=NULL;
	InitStack(L);
	L=Push(L, e);
	e=Pop(L, &e);
	printf("%d", e);
	return 0;
}