Although I was already familiar with stacks and Queues, this section introduced me to the more general case, the Deque. A Deque is a linear list that can be pushed and popped from both ends. Like a stack or queue, however, elements in the middle of it cannot be accessed.

There were a few interesting exercises on page 242 that I explored.

http://cs.marlboro.edu/ courses/ spring2012/jims_tutorials/ sam/ 2_2_Linear_Lists
last modified Wednesday February 15 2012 8:41 am EST