19.1 Introduction
We’ve studied fixed-size data structures—such as one- and two-dimensional template-based array
s (Chapter 7) and built-in arrays (Chapter 8)—and various C++ Standard Library dynamic data structures (array
s and vector
s in Chapter 7 and other template-based containers in Chapter 15) that can grow and shrink during execution.
In this chapter, we demonstrate how you can create your own custom templatized dynamic data structures. We discuss several popular and important data structures and implement programs that create and manipulate them:
Linked lists are collections of data items logically “lined up in a row”—insertions and removals are made anywhere in a linked list.
Stacks (which we introduced in Section 6.11 and discussed ...
Get C++ How to Program, 10/e now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.