Question: Rewrite the Stack Pop algorithm presented in Chapter 3 assuming that top was initialized to 0 instead of -1. if(top == -1) returnnull; // **
Rewrite the Stack Pop algorithm presented in Chapter 3 assuming that top was initialized to 0 instead of -1.
if(top == -1)
returnnull; // ** underflow error **
else{
topLocation = top;
top = top - 1;
return data[topLocation]; // returns a
} // shallow copy
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
