Lecture 23 Objectives

At the end of today's class you should

KNOW:

that a stack is a LIFO (last-in-first-out) data structure
that a stack is a useful data structure for any data that needs to be processed in reverse order
that a stack is often used to implement function calls/returns

BE ABLE TO:

implement the stack operations (push, pop, isEmpty) using a linked list
use a stack to solve various problems

Sample Exam Question:

Assume that a stack is defined using a linked list implementation (as we did in class), and that sPtr is a pointer to the top of the stack. Write C code that will print the data in a linked list in reverse order. Use the stack operations in your solution.

Example: if the linked list looks like this:

    head-->  5--> 2--> 16--> 23-->NULL

then your code should print out

23 16 2 5