Linked List Implementation of the Stack ADT
Invariant:
1. The items in the stack are stored in a linked list, with the top
of the stack stored at the head node, down to the bottom of the
stack at the final node.
2. The member variable top_ptr is the head pointer of the linked
list of items.
Previous slide
Next slide
Back to first slide
View graphic version