Question: Rewrite the Stack Push algorithm presented in Chapter 3 assuming that top was initialized to 0 instead of -1. if(top == size - 1) returnfalse;
Rewrite the Stack Push algorithm presented in Chapter 3 assuming that top was initialized to 0 instead of -1. if(top == size - 1) returnfalse; // ** overflow error **else{ top = top + 1;data[top] = newNode.deepCopy(); returntrue; // push operation successful}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
