C++实现栈

这是从前一篇博客的"C++实现队列"稍作修改得到的:

#include<iostream.h>

struct Node{
    int num;
	Node *next;
	Node *father;
};

class quene{
Node *tail;
Node *head;
public:
	 quene();   //构造函数不能有返回值
	 pop();
	 push();
	 print();
	 count();
};

 quene::quene()
{
     Node *temp=new Node;
     if (NULL == temp)  
        {  
            cout << "Failed to new the node." << endl;  
        }  
        temp->num = NULL;  
        temp->next = NULL;
		temp->father = NULL;
        head = temp;  
        tail = temp;  
   //return 1;  constructors not allowed a return type
}
quene::pop()
{
   if(head->next==NULL)
   {
     cout<<"The Queue is empty"<<endl;
   }
   else
   {
	   cout<<"Pop`s num is "<<head->next->num<<endl;
	   head->next=head->next->next;
   }
}
int quene::push()
{
	Node *temp=new Nod