Module 4: Stacks Flashcards
1
Q
is a data structure that stores and retrieves
items in a last-in-first-out (LIFO) manner.
A
stack
2
Q
causes a value to be stored in (pushed onto)
the stack
A
push
3
Q
retrieves and removes a value from the
stack
A
pop
4
Q
A Boolean operation needed for
static stacks. Returns true if the stack is full.
Otherwise, returns false.
A
isFull:
5
Q
A Boolean operation needed for all
stacks. Returns true if the stack is empty.
Otherwise, returns false.
A
isEmpty:
6
Q
Fixed size
Can be implemented with an array
A
Static Stacks
7
Q
Grow in size as needed
Can be implemented with a linked list
A
Dynamic Stacks
8
Q
may be implemented as a
vector, a list, or a deque
A
STL stack container
9
Q
Because the stack container is used to adapt
these other containers, it is often referred to as a
A
container adapter.
