Skip to main content
Contents Index Dark Mode Prev Up Next \(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 4.1 Objectives
To appreciate that list-like data types such as arrays and vectors which rely on storing data in contiguous memory are just one type of list-like structure.
To learn that linked lists are a different list-like data structure.
To write code which manipulates linked lists in C++.
Understand node and pointer diagrams to illustrate the linked list.
To learn how singly and doubly linked lists are implemented in C++.
To understand the abstract data types node and linked list, including the unordered list and ordered list.
