Array Stack Data Structure
S
0
size - 1
f
e
d
c
b
void push(Object x) {
assert(!is_full())
S[back] = x
back++
}
Object top() {
assert(!is_empty())
return S[back - 1]
}
back
Object pop() {
back--
return S[back]
}
bool is_empty() {
return back == 0
}
bool is_full() {
return back == size
}
Previous slide
Next slide
Back to first slide
View graphic version