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\,}$}}}
\)
Section 8.1 Objectives
-
To understand what a tree data structure is and how it is used.
-
To see how trees can be used to implement a map data structure.
-
To implement trees using a list.
-
To implement trees using classes and references.
-
To implement trees as a recursive data structure.
-
To implement a priority queue using a heap.
You have attempted
of
activities on this page.
