ADTs: Stacks and Queues Introduction to the Stack
[Pages:9]ADTs: Stacks and Queues
CS 3358 Summer II 2013
Jill Seaman
All Sections of chapter 16 (or Gaddis chapter 18)
1
Stack Operations
! Operations:
- push: add a value onto the top of the stack
make sure it's not full first.
- pop: remove (and return) the value from the top of the stack
make sure it's not empty first.
- isFull: true if the stack is currently full, i.e.,has no more space to hold additional elements
- isEmpty: true if the stack currently contains no elements
! These operations should take constant time3 : O(1).
string name1 = "Steve Jobs"; cout ................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related searches
- introduction to finance and accounting
- introduction to leadership and management
- introduction to java programming and data structures
- introduction to language and linguistics
- introduction to leadership and governance
- introduction to philosophy and logic
- introduction to positive and negative numbers
- introduction to leadership concepts and practice
- introduction to food and beverage service
- introduction to the stock market
- introduction to probability and mathematical statistics pdf
- introduction to the teaching profession