This chapter will explore two additional abstract data structures, stacks and queues. We have already implemented them without our knowledge, so we won’t spend much time on that but instead explore what we can do with them.
The operations we need from a stack are the following:
You can push an element onto a stack.
You can get the most recent element you pushed.
You can pop an element from a stack, which means you remove the most recent element you pushed. Getting and removing the top element on the stack are ...
