链栈的表示和实现

#include<iostream>
using namespace std;
typedef int elemtype;
typedef struct stacknode
{
	elemtype data;
	struct stacknode* next;
}stacknode,*linkstack;
bool initstack(linkstack& s)//链栈初始化
{
	s = NULL;
	return 1;
}
bool emptystack(linkstack s)//判断链栈是否为空
{
	if (s == NULL)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}
bool push(linkstack& s, elemtype e)//链栈的入栈
{
	stacknode* p = new stacknode;
	p->data = e;
	p->next = s;
	s = p;
	return 1;
}
bool pop(linkstack& s, elemtype& e)//链栈的出栈
{
	if (s == NULL)
	{
		return 0;
	}
	e = s->data;
	stacknode* p = s;
	s = s->next;
	delete p;
	return 1;
}
elemtype gettop(linkstack s)
{
	if (s != NULL)
	{
		return s->data;
	}
}









int main()
{
	linkstack s;
	return 0;
}