链栈（C语言）

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
//定义链栈
typedef struct LNode {
	int data;
	struct LNode *next;
} LNode , *LiStack;

//初始化一个带头结点的链栈
bool InitStack(LiStack &S) 
{
	S = (LNode*)malloc(sizeof(LNode));
	if(S==NULL)
		return false;
	S->next = NULL;
	return true;
}

//进栈
LNode *Push(LiStack &S) 
{
	int x,z;
	printf("请输入进栈的元素个数：");
	scanf("%d",&x);
	LNode *p;
	LNode *g;
	g = S;
	for(int i=0; i<x; i++) 
	{
		printf("请输入您要进栈的第%d个元素：",i+1);
		scanf("%d",&z);
		p = (LNode*)malloc(sizeof(LNode));
		p->data = z;
		p->next = g->next;
		g->next = p;
	}
	return S;
}

//打印栈
void PrintStack(LiStack S) 
{
	LNode *p;
	p = S->next;
	while(p!=NULL) 
	{
		printf("%3d",p->data);
		p = p->next;
	}
	printf("\n");
}

//出栈
bool Pop(LiStack &S,int *x) 
{
	if (S->next == NULL)
		retu