Java

class Stack {

public Stack() {

val = new int [100];

top = -1;

}

public void push(int x) {

if (isFull()) …

val[++top] = x;

}

public int pop() {

if (isEmpty()) …

return val[top--];

}

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

private boolean isFull() {return top >= 99;}

private int top;

private int val[];

}

Previous slide

Next slide

Back to first slide

View graphic version