Queue

After reading this chapter and engaging in the embedded activities and reflections, you should be able to:

  • Explain and trace the core operations of Queue (enqueue, dequeue, front, empty).
  • Describe the difference between enqueue and dequeue.
  • Implement the core operations of Queue efficiently (array based and linked base).
  • Explain why an efficient linked implementation of Queue requires a tail pointer.
  • Explain why an efficient array based implementation of Queue can logically be viewed as a circular data structure.
  • Define Steque, Quack, and Deque ADT.

Starter code for this chapter

Solution code

Solution code for this chapter.