Skip to main content\(
\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\,}$}}}
\)
Chapter 16 Data Structures: Lists, Stacks, and Queues
After studying this chapter, you will:
Objectives
Understand the concepts of a dynamic data structure and an Abstract Data Type (ADT).
Be able to create and use dynamic data structures such as linked lists and binary search trees.
Understand the stack, queue, set, and map ADTs.
Be able to use inheritance to define extensible data structures.
Know how to use the TreeSet, TreeMap, HashSet, and HashMap library classes.
Be able to use the Java generic type construct.
