n Pilha revisitada
n
nclass StackImpl implements StackInterf {
n private int[] data;
n private int top_index;
n Stack(int size) {
n data = new int[size];
n top_index = -1;
n }
n boolean
isEmpty() { return (top_index < 0); }
n void push(int
n)
{ data[++top_index] = n; }
n int pop() { return
data[top_index--]; }
n int top() { return
data[top_index]; }
n}