链栈的操作

#include 
using namespace std;

//链栈,理论上只要内存够大不存在上溢，只存在下溢（栈空后继续取出元素）
typedef struct _QNode
{
	int data;
	struct _QNode *next;
}StNode;

bool initStack(StNode* &st)
{
	st = new StNode;
	if(!st) return false;
	st->next = NULL;
	return true;
}

bool isEmpty(StNode *st)
{
	if(st->next == NULL)
		return true;
	else
		return false;
}

bool pushStack(StNode* &st, int e)
{
	
	StNode *node = new StNode;
	if(!node) return false;
	
	
	node->data = e;
	node->next = st->next;
	st->next = node;
	
	return true;
}

bool popStack(StNode* &st, int &e)
{
	if(!(st->next)) return false;	//栈空
	StNode *p;
	p = st->next;
	
	e = p->data;
	st->next = p->next;
	delete p;
	
	return true; 
}