链栈--简单操作

建立一个链栈，实现栈的压栈和出栈操作

#include<iostream>
using namespace std;
class Node{
	friend class Linkstack;
private:
int data;
Node * next;
};

class Linkstack{
public:Linkstack(){top=NULL;}
	   ~Linkstack(){};
	   void Push(int x);
	   void  Print();
	   int Pop();
	   int Gettop(){if(top!=NULL) return top->data;}
	   int Empty(){
		   if(top==NULL) return 1;   
		  return 0; }
private:
	Node* top;
};
void Linkstack::Push(int x){    //进栈
Node *s;
s=new Node;
s->data=x;
s->next=top;
top=s;
}

int Linkstack::Pop(){    //出栈
Node *p;
int x;
if(top==NULL) throw "下溢";
x=top->data;
p=top;
top=top->next;
delete p;
return x;
}


int main(){
Linkstack Que;
int a[20],n,i,x;
cout<<"How many number do you want?"<<endl;
cin>>n;
cout<<"请依次输入进栈的值：";
for(i=0;i<n;i++)
{
cin>>x;
Que.Push(x);
}
cout<<"栈顶为："<<Que.Gettop()<<endl;
cout<<"出栈顺序为:"<<endl;
for(i=0;i<n;i++)
cout<<Que.Pop()<<" ";
cout<<endl;

return 0;
}

实验结果：