实验C—2 链栈基本操作压栈与出栈

实验代码：

#include<iostream>
using namespace std;
class LinkStack {
	int data;
	LinkStack *top;
	LinkStack *next;
public:
	LinkStack() { top = NULL; }
	void push(int);
	void pop();
	int empty() { if (top == NULL)return 1; else return 0; }
};
void LinkStack::push(int x) {
	LinkStack *p = new LinkStack;
	p->data = x;
	p->next = top;
	top = p;
}
void LinkStack::pop() {
	while (empty() != 1) {
		cout << top->data;
		top = top->next;
	}
}
void main() {
	LinkStack p;
	p.push(1); p.push(2); p.push(3); p.push(4); p.push(5);
	p.pop();	cout << endl;

}

实验结果：