Stack ADT and Implementation

• A stack is a LIFO data structure (i.e. a data structure that retrieves data in the reverse of the order in which the data is stored)

• Items enter the stack and leave the stack from the top

• Basic operations: push, pop, empty (plus you’ll need constructors, a destructor, and overloaded assignment operator)

• Implementation: stack.h, stack.C

• Test file: 14-13.cxx

Previous slide

Next slide

Back to first slide

View graphic version