Stack Implementation(3/3) 7 void push(int x) { if (top>=7) { /* STACK OVERFLOW */ return; } stack[++top] = x; /* top refers the most recently pushed item */ return; } int pop() { int err = -2147483647; if (top<0) { /* STACK IS EMPTY */ return err; } return stack[top--]; }