6. Abstract Data Types: Stacks and Queues
1: Abstract Data Types
2: Stack ADT
3: Stack Model -- LIFO
4: Derivable Behaviors (Theorems)
5: Uses of ADT Stack
6: Queue ADT
7: Queue Model -- FIFO
8: Derivable Behaviors (Theorems)
9: Uses of ADT Queue
10: Depth First Search -- Backtracking
11: DFS -- Backtracking (cont.)
12: Breadth First Search
13: BFS (cont.)
14: Evaluating Postfix Expressions -- Algorithm
15: Evaluating Postfix Expressions -- Example
16: Runtime Stack and Recursion
17: Adaptor Classes
18: Stack and Queue Adaptor Requirements
19: CStack <T,C>
20: CQueue <T,C>
21: Example Usage -- Testing CStack and CQueue
22: Converting Infix to Postfix
Copyright notice: The source documents, rendered pages, and content
in this course are proprietary and may not be copied without express written
permission of the author. (C) 2011 R.C. Lacher, Florida State University.
|