Data Stack
# Java Example - Stack Implementation
[ Java Example](#)
The following example demonstrates how a user can implement a stack by creating a custom function `push()` method for inserting elements and a `pop()` method for popping elements:
## MyStack.java File
public class MyStack{private int maxSize; private long[]stackArray; private int top; public MyStack(int s){maxSize = s; stackArray = new long; top = -1; }public void push(long j){stackArray[++top] = j; }public long pop(){return stackArray; }public long peek(){return stackArray; }public boolean isEmpty(){return(top == -1); }public boolean isFull(){return(top == maxSize - 1); }public static void main(String[]args){MyStack theStack = new MyStack(10); theStack.push(10); theStack.push(20); theStack.push(30); theStack.push(40); theStack.push(50); while(!theStack.isEmpty()){long value = theStack.pop(); System.out.print(value); System.out.print(""); }System.out.println(""); }}
The output of the above code is:
50 40 30 20 10
[ Java Example](#)
YouTip