Stacks

A stack is a list that operates under the principle "last in, first out" (LIFO).
- New elements are pushed onto the stack.
- Old elements are popped off the stack.
- To enforce the LIFO principle, we push and pop at the same end.
Implement a stack as a subclass of a list class.
- Use PushFront() and PopFront(), or
- Use PushBack() and PopBack().
- Choose a list class for which pushing and popping will be efficient.
Use private inheritance
- This prevents violations of the LIFO principle.
- The stack class has access to all public and protected list functions.
- The stack class user has access only to the stack functions.

This page was last modified on Mar 28, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/Stacks.html