JAVA STACK PROGRAM TO DEFINE AN INTEGER STACK THAT CAN HOLD TO VALUES

//java stack program define an integer stack that can hold 10 values
PROGRAM CODE------

class Stack
{
int stk[]  = new int[10];
int tos;

Stack()
{
tos=-1;       //initialize top of stack
}
 
//push item in to stack
void push(int item)
{
if(tos==9)
System.out.println("Stack is full");
else
stk[++tos]=item;

}
//pop item from the stack
int pop()
{
if(tos<0)
{
System.out.println("Stack underflow");
return 0;
}
else
return stk[tos--];
}
}
class StackValue
{
public static void main(String ar[])
{
Stack mystack1 = new Stack();
Stack mystack2 = new Stack();

//push some numbers on to stack

for(int i=0;i<10;i++)
mystack1.push(i);
for(int i=10;i<20;i++)
mystack2.push(i);

//pop these numbers off the stack
System.out.println("Stack in mystack1");
for(int i=0;i<10;i++)
System.out.println(mystack1.pop());

System.out.println("Stack in mystack2");
for(int i=0;i<10;i++)
System.out.println(mystack2.pop());
}
}


 OUTPUT OF ABOVE PROGRAM---


Comments