顺序栈：
#include<iostream>
using namespace std;
const int StackSize=10;
class SeqStack
{
public:
SeqStack(){top=-1;}
~SeqStack(){}
void Push(int x);
int Pop();
int GetTop()
{if(top!=-1) return data[top];}
int Empty();
private:
int data[StackSize];
int top;
};
void SeqStack::Push(int x)
{
if(top==StackSize-1)throw"上溢";
data[++top]=x;
}
int SeqStack::Pop()
{
int x;
if(top==-1)throw"下溢";
x=data[top--];
return x;
}
int SeqStack::Empty()
{
if(top==-1) return 1;
else return 0;
}
void main()
{
SeqStack Q;
if(Q.Empty())
cout<<"栈非空"<<endl;
else
cout<<"栈为空"<<endl;
cout<<endl;
cout<<"对15和10执行入栈操作"<<endl;
Q.Push(15);
Q.Push(10);
cout<<endl;
cout<<"栈顶元素为:"<<endl;
cout<<Q.GetTop()<<endl;
cout<<endl;
cout<<"执行一次出栈操作"<<endl;
Q.Pop();
cout<<endl;
cout<<"执行一次出栈操作后栈顶元素为:"<<endl;
cout<<Q.GetTop()<<endl;}
链栈：
#include<iostream.h>
struct Node
{
int data;
struct Node *next;
};
class Linkstack
{
private:
Node *top;
public:
Linkstack();
~Linkstack(){}
void push(int x);
int get();
int pop();
};
Linkstack::Linkstack()
{
top=NULL;
}
int Linkstack::get()
{
return top->data;
}
int Linkstack::pop()
{
int x;
Node *p;
if(top==NULL)throw"下溢";
x=top->data;
p=top;
top=top->next;
delete p;
return x;
}
void Linkstack::push(int x)
{
Node *s;
s=new Node;
s->data=x;
s->next=top;
top=s;
}
int main()
{
Linkstack L;
cout<<"请对78,90,100进行入栈操作："<<endl;
L.push(78);
L.push(90);
L.push(100);
cout<<endl;
cout<<"查看栈顶元素"<<endl;
cout<<L.get()<<endl;
cout<<endl;
cout<<"执行一次出栈操作"<<endl;
L.pop();
cout<<endl;
cout<<"执行一次出栈后栈顶元素"<<endl;
cout<<L.get()<<endl;
return 0;
}