栈的基本操作.doc

#include#includeusing namespace std;class Stack;class StackNode friend class Stack;private: int data; StackNode *link; StackNode(int d = 0,StackNode *l = NULL):data(d),link(l);class Stack StackNode *top;public: Stack():top(NULL) Stack(); bool Push(const int &item); int Pop(); int GetTop(); bool IsEmpty()const; void makeEmpty(); int getSize(); void print(Stack&); void Meun();#includestack.hStack:Stack() StackNode *p; while(top != NULL) p = top; top = top-link; delete p; bool Stack:Push(const int &item) top = new StackNode(item,top); return true;int Stack:Pop() assert(!IsEmpty(); StackNode *p = top; int retvalue = p-data; top = top-link; delete p; return retvalue;int Stack:GetTop() assert(!IsEmpty(); return top-data;bool Stack:IsEmpty()const return top = NULL;void Stack:makeEmpty()StackNode *p;while(top!=NULL)p=top;top=top-link;delete p;int Stack:getSize() StackNode *p=top;int k=0;while(top!=NULL)top=top-link; k+;return k;void Stack:print(Stack& s)StackNode *p=s.top;int i=0;while(p!=NULL)coutdatalink;coutendl;void Stack:Meun()cout*菜单*endl;cout1-输出栈内元素(栈顶到栈尾）endl;cout2-元素进栈endl;cout3-元素出栈endl;cout4-读取栈顶元素endl;cout5-得到栈中元素个数endl;cout6-清空栈endl;cout0-退出endl;cout*endl;coutchoice; while(choice!=0) switch(choice) case 1: cout从栈顶到栈尾元素的输出为：endl; A.print(A); break; case 2: coutx; A.Push(x); break; case 3: cout弹出的元素是：A.Pop()endl; break; case 4: cout栈顶元素是：A.GetTop()endl; break; case 5: cout栈中元素个数是：A.getSize(