c++写的链栈.docxVIP

LinkStack.h#includeiostream#includexcept.husing namespace std;templateclass Tstruct Node{T data;struct NodeT * link;};templateclass Tclass LinkStack{public:LinkStack(){top = 0;};~LinkStack();bool IsEmpty() const{return top ==0;}T GetTop() const;bool Push(const T x);bool Pop(T x);bool Pop();//void Output(ostream out)const;private:NodeT *top;};templateclass TLinkStackT::~LinkStack(){NodeT *next;while(top){next = top-link;delete top;top = next;}}templateclass TT LinkStackT::GetTop()const{if(IsEmpty())throw OutOfBounds();return top-data;}templateclass Tbool LinkStackT::Push(const T x){NodeT *p = new NodeT;p-data = x;p-link = top;top = p;return true;}templateclass Tbool LinkStackT::Pop(T x){if(IsEmpty()) throw OutOfBounds(); return false;x = top-data;NodeT *p = top;top = top-link;delete p;return true;}templateclass Tbool LinkStackT::Pop(){if(IsEmpty())throw OutOfBounds();return false;NodeT *p = top;top = top-link;delete p;return true;}Xcept.h// exception classes for various error types#ifndef Xcept_#define Xcept_#include new.h// bad initializersclass BadInitializers { public: BadInitializers() {}};// insufficient memoryclass NoMem { public: NoMem() {}};// change new to throw NoMem instead of standard behavior// Visual C++ requires following form of my_new_handlerint my_new_handler(size_t x){ throw NoMem(); // even though the following statement is unreachable, // visual C++ will not compile successfully without it return 0;};//_PNH Old_Handler_ = _set_new_handler(my_new_handler);// improper array, find, insert, or delete index// or deletion from empty structureclass OutOfBounds { public: OutOfBounds() {}};// use when operands should have matching sizeclass SizeMismatch { public: SizeMismatch() {}};// use when zero was expectedclass MustBeZero { public: MustBeZero() {}};// use when zero was expectedclass BadInput { public: BadInput() {}};#endifMain.cpp#includeiostream#includexcept.h#includeLinkStack.husing namespace std;//templateclass Tvoid main(){try{LinkStackintOPND;Li