C++实现链栈

构造链栈类

//链栈的存储结构
typedef struct StackNode
{
	SElemType data;
	struct StackNode* next;
}StackNode, * LinkStack;

函数实现

//初始化
void InitStack(LinkStack& S)
{
	S = NULL;	//构造一个空栈，栈顶指针置空即可
}

//入栈
int Push(LinkStack& S, SElemType e)
{
	//链栈不需要判断栈满

	StackNode* p = new StackNode;
	p->data = e;
	p->next = S;
	S = p;
	return 1;
}

//出栈
int Pop(LinkStack& S, SElemType& e)
{
	if (S == NULL) return 0;    //栈空

	StackNode* p = S;
	e = S->data;
	S = S->next;
	delete p;
	return 1;
}

//取栈顶元素
SElemType GetTop(LinkStack S)
{
	if (S != NULL)	 //非栈空时返回
		return S->data;
}

//遍历输出栈
//遍历输出栈
void printStack(LinkStack S)
{
	printf("栈顶->");
	StackNode* p = S;
	while (p != NULL)
	{
		cout << p->data << endl;
		p = p->next;
	}
}

测试

int main()
{
	LinkStack S;
	int e;
	InitStack(S);

	cout << "请输入一个要入栈的元素：" << endl;
	cin >> e;
	Push(S, e);
	printStack(S);

	cout << "请输入一个要入栈的元素：" << endl;
	cin >> e;
	Push(S, e);
	printStack(S);

	cout << "出栈测试：" << endl;
	Pop(S, e);
	printStack(S);

	cout << "取栈顶元素测试："<< endl;
	e = GetTop(S);

	cout << "取出的栈顶元素为：" << e << endl;

}