Algorithm for PUSH operationPUSH(STACK, TOP, SIZE, ITEM)Step 1: if TOP >= N-1 thenPRINT “stack is overflow”ExitEnd of ifStep 2: Top = TOP + 1Step 3: STACK[TOP] = ITEMStep 4: Return
Your experience on this site will be improved by allowing cookies. Read Cookie Policy