Skip to main content
Lesson 38 - Stacks
ZIPPDF (letter)
Lesson MenuNext
  
Introduction page 1 of 6

When studying recursion you were introduced to the concept of a stack. A stack is a linear data structure with well-defined insertion and deletion routines. The stack abstraction has been implemented for you in the ArrayStack class. After covering the member methods available in implementing a stack interface, the lab exercise will use stacks to solve a non-recursive inorder tree traversal problem.

The key topics for this lesson are:


Lesson MenuNext
Contact
 ©ICT 2003, All Rights Reserved.