template class gmStack{ private Stack S; Stack m; public gmStack(); ~gmStack(); void push(item *); item * pop(); item * getMin(); } void gmStack::push(item * i){ S.push(i); item *t=m.pop(); m.push(t); if(i<=t) m.push(i); } item *gmStack::pop(){ item *t=m.pop(); item *r=S.pop(); if(t!=r) m.push(t); return r; } item *gmStack::getMin(){ item *t=m.pop(); m.push(t); return t; } gmStack::gmStack(){ S=new Stack(); m=new Stack(); } gmStack::~gmStack(){ delete S; delete m; }

I would use two stacks. Pop from 1 to other while checking to see the minimum number. When u r done, re-push from stack2 back to S1 to get the original stack. return minimum. Stack S1; //stack contains data of ints int min=0; //initialize min int Stack::getmin(Stack& S1) { Stack S2; //Transfer all from S1 to S2 while(!S1.isEmpty()) { int temp = S1.pop(); if(temp

in the above answer, please change the "int min to 1000000". I intended to initialize to a high number.

Declare two stacks. One is the real stack of data. The other is a temporary one. Pop from real to temp. As u pop, check for minimum, save it in a variable. When finished, pop from temp stack back to real stack. Stack S1; //stack contains data of ints int Stack::getmin(Stack& S1) { int min=1000000; //initialize min Stack S2; //Transfer all from S1 to S2 while(!S1.isEmpty()) { int temp = S1.pop(); if (temp

Use two stacks, one for the real stack, and one to hold the list of minimums. When you pop, check to see if its the minumum. If so, also pop it off the second stack.

Wouldn't be easier to just have a variable min and compare to each int as you push it onto the stack: int min=firstInt; if(min>=nextPush) min=nextPush; Really you could just make that into a separate method too and just call it with push . . . or maybe I'm over simplifying.