창고 의 기본 조작 (체인 창고 순서 창고)

#include 
using namespace std;
class node{
	public:
	int data;
	node* next;
};
class stack  //           
{
	public:
		stack();
		~stack();
		bool empty();
		void pushstack(int );
		void popstack();
		void gettop();
		void printstack();
	private:
		node* top;
	protected:
};
stack::stack()
{
	top->next=NULL;
}
stack::~stack()//         
{
	node* p=new node;
	node* q=top->next;
	while(q){
		p=q;
		q=q->next;
		delete p;
	}
}
bool stack::empty()//  
{
	if(top->next==NULL)
		return true;
	return false;
}
void stack::gettop()//      
{
	if(empty())
		cout<next->data<data=a;
	p->next=top->next;
	top->next=p;
}
void stack::popstack()  //  
{
	if(empty())
		cout<next;
	top->next=q->next;	
}	
void stack::printstack()
{
	node* p=top->next;
	while(p){
		cout<data;
		p=p->next;
	}
}
	
int main(int argc, char** argv) {
	stack A;
	int num;
	cin>>num;
	while(num!=-1)     //       -1    
	{
		A.pushstack(num);
		cin>>num;
	}
	A.printstack();   //      
	return 0;
}	

#define maxsize 100
#include 
using namespace std;
class stack
{
public:
	stack();
	~stack();
	void pushstack(int) ;
	void popstack();
	bool is_empty();
	bool is_full();
	int gettop();
	void printstack();
private:
	int top;
	int data[maxsize];
};
bool stack::is_empty()
{
	if(top == -1)
		return true;
	return false;
}
bool stack::is_full()
{
	if(top == maxsize-1)
		return true;
	return false;
}
void stack::pushstack(int a)
{
	if(is_full()){
		cout<=0;){
		cout<>num;
	while(num != -1){
		A.pushstack(num);
		cin>>num;
	}
	A.printstack();
	return 1;
	 
}