栈的数组表示一顺序栈 include assert h> template <class Type> class Stack i public: Stack( int=10 ); 构造函数 Sck(){ delete[] elements;M/析构函数 void push( const Type&iem);∥进 Type Pop (; ∥/出栈 Type GetTop o; /取栈顶元素 void MakeEmpty(){top=-1;}∥量空栈 int IsEmpty( const return top==-1;)#include <assert.h> template <class Type> class Stack { public: Stack ( int=10 ); //构造函数 ~Stack ( ) { delete [ ] elements; }//析构函数 void Push ( const Type & item ); //进栈 Type Pop ( ); //出栈 Type GetTop ( ); //取栈顶元素 void MakeEmpty ( ) { top=-1; } //置空栈 int IsEmpty ( ) const { return top == -1; } 栈的数组表示 — 顺序栈