顺序栈的操作 template <class e> void seqstackE>:: overflow Processo& 私有函数:当栈满则执行扩充栈存储空间处 理 e* newArray =new e[2* maxSize]; 创建更大的存储数组 for (int 1=0; i<=top; 1++) newArrayli]=elements[i maxSize + maxSize delete l elements; elements= newArray;∥1变 elements指针8 顺序栈的操作 template <class E> void SeqStack<E>::overflowProcess() { //私有函数：当栈满则执行扩充栈存储空间处 理 E *newArray = new E[2*maxSize]; //创建更大的存储数组 for (int i = 0; i <= top; i++) newArray[i] = elements[i]; maxSize += maxSize; delete [ ]elements; elements = newArray; //改变elements指针 };