【无标题】数据结构。链栈的一些操作(定义、进栈、出栈)

#include<iotream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;

// 构造节点 
typedef struct StackNode{
	int data;
	struct StackNode *next;
}StackNode,*LinkStackPrt;

//构造链栈 
typedef struct LinkStack{
	LinkStackPrt top;
	int count;
}LinkStack;
//初始化 
void init_Stack(LinkStack &s){
	s->top = -1;
}
//判断栈空 
bool empty_Stack(LinkStack &s){
	return (s->top == -1)? false:true;
}
//进栈 
LinkStack push_Stack(LinkStack &s){
	LinkStackPrt p = (LinkStackPrt)malloc(sizeof(StackNode));
	int x;
	scanf("%d",&x);
	while(x!=999){
		p->data = x;
		p->next = s->top;
		s->top = p;
		s->count++;
		scanf("%d",&x);
	}
	return LinkStack;
}
//出栈 
Status pop_Stack(LinkStack &s){
	LinkStackPrt p;
	if(empty_Stack(&s))
		return ERROR;
	p = s->top;
	s->top = s->top->next;
	free(p);
	s->count--;
	return OK;
}
int main(){
	LinkStack s;
	
	return 0;
}