数据结构-链栈的基本操作代码实现

（数据结构复习day4）

#include <iostream>
using namespace std;

typedef int ElemType;
typedef struct StackNode {
	ElemType data;
	struct StackNode* next;
}StackNode, * LinkStack;

bool InitStack(LinkStack//初始化链栈
bool Push(LinkStack& S, ElemType e);//将元素e压入栈中
bool Pop(LinkStack& S, ElemType//将首元素出栈，用元素e返回
bool StackEmpty(LinkStack S);//判断链栈是否为空
bool GetTop(LinkStack S, ElemType//取链栈栈顶元素，用元素e返回
void TraverseStack(LinkStack S);//自顶向下遍历栈
bool DestroyStack(LinkStack//销毁链栈
int StackLength(LinkStack S);//返回链栈长度
void conversion(int n, int r);//栈的应用，进制转换

bool InitStack(LinkStack& S) {
	S = NULL;
	return 1;
}
bool Push(LinkStack& S, ElemType e) {
	StackNode* temp = new StackNode;
	if (!temp)return 0;
	temp->data = e;
	temp->next = S;
	S = temp;
	return 1;
}
bool Pop(LinkStack& S, ElemType& e) {
	if (S == NULL)return 0;
	StackNode* temp = S;
	e = S->data;
	S = S->next;
	delete temp;
	return 1;
}
bool StackEmpty(LinkStack S) {
	if (S == NULL)
		return 1;
	return 0;
}
bool GetTop(LinkStack S,ElemType& e){
	if (S == NULL)return 0;
	e = S->data;
	return 1;
}
void TraverseStack(LinkStack S) {
	if (!StackEmpty(S)) {
		while (S) {
			cout << S->data << "  ";
			S = S->next;
		}
	}
	cout << endl;
}
bool DestroyStack(LinkStack& S) {
	StackNode* temp = S;
	if (!StackEmpty(S)) {
		while (S) {
			S = S->next;
			delete temp; temp = S;
		}
	}
	return 1;
}
int StackLength(LinkStack S) {
	int n = 0;
	while (S) {
		n++;
		S = S->next;
	}
	return n;
}
void conversion(int n, int r) {
	int e = 0; int m = n;
	LinkStack S; InitStack(S);
	while (n) {
		Push(S, n % r);
		n = n / r;
	}
	cout << m << "转化为" << r << "进制数为:";
	while (S != NULL) {
		Pop(S, e);
		cout << e;
	}
}


int main()
{
	LinkStack S;
	int n, i;
	ElemType e;
	if (InitStack(S))
		cout << "初始化链栈成功" << endl;
	else {
		cout << "初始化链栈失败" << endl;
		return 1;
	}
	cout << "请输入链栈元素个数：" << endl;
	cin >> n;
	cout << "请输入链栈元素：" << endl;
	for (i = 0; i < n; i++) {
		cin >> e;
		Push(S, e);
	}
	cout << "栈中元素为";
	if (StackEmpty(S))//检验链栈是否为空
		cout << "线性表为空" << endl;
	else {
		if (GetTop(S, e))
			cout << "栈顶元素为" << e << endl;
		cout << "自顶向下遍历：\n";
		TraverseStack(S);
		DestroyStack(S);
	}
	int r;
	cout << "将十进制数转化为r(1<r<10)进制数，输入r: " << endl;
	cin >> r;
	cout << "输入要转化的数: " << endl;
	cin >> n;
	conversion(n, r);
	return 0;
}

实验样例