How do you push and pop stack elements?

Answer 1

algorithm of push

if(top==Max-1)

{

cout<<"\n the stack is full";

}

else

top++;

arr[top]=item;

////////////////////////////////////////

algorithm of pop

if(top==-1)

{

cout<<"\n the stack is empty";

}

else

return arr[top];

top--;

}

Answer 2

push(stack,top,maxstk,item)

[chek the overflow condition]

1) top=maxstk, return step=4,print =overflow

else

2)set top=top+1;[incresase by 1)

3)set stack[top]=item[insert item at top, item is to insert]

4)return

pop[stack,top,item]

1) if top=0, print= underflow

2)set item=stack[top]

3)set top=top-1

4)return

by-komal prasad;meri college

Answer 3

#include

#include

#include

#include

int main() {

std::array data {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};

std::stack s; // a stack of integers (initially empty)

for (auto datum : data) s.push (datum); // push elements from array

while (!s.empty()) {

std::cout << s.top() << std::endl; // print the top value

s.pop(); // extract the top value

}

assert (s.empty());

return 0;

}