INSERTION/PUSH IN STACK/QUEUE

IN STACK
ALGORITHM
Start
Read/Accept value N
if TOP = Size then
print “OVERFLOW”
exit
else
IF TOP=-1
TOP=0
Stack[TOP] = N
TOP = TOP +1
End

FUNCTION
void push (int v)
{
if(top == size)
System.out.println (“OVERFLOW”);
else
{
if(top==-1)
top=0;
st[top++]=v;
}
 IN QUEUE
ALGORITHM
START
ACCEPT VALUE ‘N’
IF rear = Size THEN
PRINT “OVERFLOW”
ELSE
IF front = -1 THEN
front = rear=0
Queue[rear] = N
rear= rear+1
END

FUNCTION
void insert(int v)
{
if(rear == size)
System.out.println(“Overflow”)
else
{
if(front==-1)
front = rear = 0;
Que [rear++] = v;
}
}