Lecture 12 - ECE 2574 Introduction to Data Structures and...

Info icon This preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 2574 Introduction to Data Structures and Algorithms Lecture 12: Stacks Reading: Chapter 6 Chris Wyatt Electrical and Computer Engineering and School of Biomedical Engineering and Sciences Virginia Tech
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Monday Schedule Introduction to stacks Examples: - permutations, In-class exercise - image processing, In-class exercise
Image of page 2
A stack is a list in which all insertions and deletions are done at one end, denoted the top . The basic stack ADT has 7 operations. - create a stack - destroy a stack - empty query - insert (push) - remove (pop) - retrieve (peek) In the basic stack, all access is limited to the top. TOP
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon