April 2018
Intermediate to advanced
322 pages
6h 57m
English
Content preview from C++ Data Structures and Algorithms
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Constructing Stacks and Queues
In the previous chapter, we discussed several linear data types, which were list, linked list, and Doubly Linked List. In this chapter, we are going to discuss other linear data types, and those are stack, queue, and dequeue. The following are the topics we are going to discuss regarding these three data types:
- Building a Stack ADT and then fetching, pushing, and popping elements in this ADT
- Building a Queue ADT and then fetching, enqueuing, and dequeuing elements in this ADT
- Building a Dequeue ADT and then fetching, enqueuing, and dequeuing elements in this ADT