个人学习记录<2>stack类

#include <iostream>
using namespace std;
template<class T>
class Stack;
//栈节点类
template<class T>
class Snode
{
friend class Stack<T>;
public:
Snode(T _date)
{
date=_date;
next=NULL;
}
private:
T date;
Snode * next;
};
//栈类
template<class T>
class Stack
{
public:
Stack()
{
Max=10;
count=0;
top=NULL;
}
bool Is_empty()
{
if(NULL==top)
{
return true;
}
return false;
}
bool Is_full()
{
if(count==Max)
{
return true;
}
return false;
}
void Push(T _value)
{
if(!Is_full())
{
Snode<T> * Newnode=new Snode<T>(_value);
Newnode->next=top;
top=Newnode;
Newnode=NULL;
count++;
}
else
{
cout<<"stack is full..."<<endl;
}
}
void Pop()
{
if(!Is_empty())
{
Snode<T> * p_st_node=top;
top=top->next;
cout<<"pop:"<<p_st_node->date<<endl;
delete(p_st_node);
p_st_node=NULL;
count--;
}
else
{
cout<<"stack is empty"<<endl;
}
}
private:
int Max;
int count;
Snode<T> * top;
};
int main(void)
{
Stack<int> st;
st.Push(1);
st.Push(3);
st.Push(2);
st.Push(4);

st.Pop();
st.Pop();
}