vc++栈的简单实现

栈的数据类型是先进后出

 #ifndef __MYSTACK__
 #define __MYSTACK__
 #include <Windows.h>
 typedef struct Node
 {
     int data;    //数据
     Node* next;    //下一个节点
 }NODE,*PNODE;
 class Stack
 {
 public:
     Stack();
     ~Stack();
 public:
     int pop();    //返回这个出栈的数据
     BOOL push(int pS);    //接收入栈的数据
     BOOL empty();        //判断栈是否是null 如果是null返回TRUE
     int treaverse();    //遍历所有数据

 private:
     PNODE m_pTop;    //栈顶
     PNODE m_pBottom;    //栈底
 };
 Stack::Stack()
 {
     m_pTop = new NODE;
     if(!m_pTop)return;
     m_pTop->next = NULL;    //下一个节点等于null
     m_pBottom = m_pTop;
 }
 Stack::~Stack()
 {
     //析构
     if (empty())
     {
         delete m_pTop;
     }else
     {
         PNODE p = m_pTop;
         while (p!=m_pBottom)
         {
             p = m_pTop->next;
             delete m_pTop;
             m_pTop = p;
         }
         delete m_pBottom;
     }

 }
 int Stack::push(int pS)
 {
     PNODE pNext = new NODE;
     if(!pNext)return -;
     ZeroMemory(pNext,sizeof(NODE));
     pNext->data = pS;    //传进来的参数
     pNext->next = m_pTop;
     m_pTop = pNext;
     return true;
 }
 BOOL Stack::empty()
 {
     if (m_pTop == m_pBottom)
         return true;
     else
         return false;
 }
 int Stack::pop()
 {
     int temp = NULL;
     if (empty())
         return -;
     PNODE p  = m_pTop->next;
     temp = m_pTop->data;    //获取到的数据
     delete m_pTop;
     m_pTop = p;
     return temp;
 }
 int Stack::treaverse()
 {
     if(empty())return -;
     PNODE p = m_pTop;
     while(p!=m_pBottom)
     {
         printf("%d\r\n",p->data);
         p = p->next;
     }
 }
 #endif //__MYSTACK__