Stack data structure : Stack « Collections Data Structure « Java

Stack data structure

Stack data structure
public class MyStack {
  private int maxSize;

  private long[] stackArray;

  private int top;

  public MyStack(int s) {
    maxSize = s;
    stackArray = new long[maxSize];
    top = -1;

  public void push(long j) {
    stackArray[++top] = j;

  public long pop() {
    return stackArray[top--];

  public long peek() {
    return stackArray[top];

  public boolean isEmpty() {
    return (top == -1);

  public boolean isFull() {
    return (top == maxSize - 1);

  public static void main(String[] args) {
    MyStack theStack = new MyStack(10); // make new stack

    while (!theStack.isEmpty()) {
      long value = theStack.pop();
      System.out.print(" ");

Related examples in the same category

1.Demonstration of Stack ClassDemonstration of Stack Class
2.Stack in java.utilStack in java.util
3.Bracket Checker
4.String Reverser Through Stack String Reverser Through Stack
5.Link stackLink stack
6.Triangular numbersTriangular numbers
7.Triangular numbers with stack replaces recursionTriangular numbers with stack replaces recursion
8.Show String ReversalsShow String Reversals
9.Generic stack demo with annotation
10.Character Stack
11.A faster, smaller stack implementation.
12.Growable Object stack with type specific access methods
13.Growable int stack with type specific access methods
14.Stack for boolean values
15.extends ArrayList to create Stack
16.Growable String stack with type specific access methods.
17.A simple integer based stack.
18.A very simple unsynchronized stack. This one is faster than the java.util-Version.
19.Pop an empty stack ntry times and catch the resulting exceptionPop an empty stack ntry times and catch the resulting exception
20.Object Stack
21.Fast stack