Linked List Stack Data Structure
void push(Object x) {
temp = back
back = new Node(x)
back->next = temp
}
Object top() {
assert(!is_empty())
return back->data
}
Object pop() {
assert(!is_empty())
return_data = back->data
temp = back
back = back->next
return return_data
}
bool is_empty() {
return back == null
}
Previous slide
Next slide
Back to first slide
View graphic version