数据结构---栈（链栈）

   **链栈的结构和单链表相似，只不过插入的时候一般采用头插法，以保证先进后出。**

class StackNode
{
public:
	DataType data;
	StackNode *next;
	StackNode()
	{
		next = NULL;
	}
};

class LinkStack
{
private:
    StackNode *top;
public:
    LinkStack()
    {
        top = NULL;
    }
    ~LinkStack()
    {
        StackNode *p;
        while(top)
        {
            p=top;
            top = top->next;
            delete p;
        }
        top = NULL;
    }
	//判空
    int Empty_Stack()
    {
        return(!top);
    }
    //入栈
    int Push_Stack(int e)
    {
        StackNode *p = new StackNode;
        if(p)
        {
            p->data=e;
            p->next=top;
            top=p;
            return 1;
        }
        else
        {
            return 0;
        }
    }
    //出栈
    int Pop_Stack(int &e)
    {
        StackNode *p;
        if(top)
        {
            p=top;
            e=p->data;
            top=top->next;
            delete p;
            return 1;
        }
        else
            return 0;
    }
    //得到栈顶元素
    int GetTop_Stack(int &e)
    {
        if(top)
        {
            e=top->data;
            return 1;
        }
        else
            return 0;
    }

};