CHAPTER 18
Introduction toLinked Lists
Chapter Objectives
By the end of the chapter, readers will be able to:
Explain the overall concept of a data structure.
Graphically illustrate and discuss the various components associated with a linked list, including nodes, a head pointer, an optional tail pointer, and a trailing pointer.
Develop and implement various functions for manipulating the individual nodes within a linked list, including inserting, ...
Get C++: An Active Learning Approach 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.
