
\begin{minipage}[t]{8in}
\begin{tabular}{ll}
void*  & info\index{ContainerNode!info}()
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return the address of the information stored in {\em ContainerNode}.
	 This is useful in creating a consistent interface between 
	 {\em Containers}
	 and algorithms.  For example,  consider the following code:

\begin{flushleft}
Container$<$int$>$ *cp = createMysteryLinkedIntContainer();\\
ContainerNode$<$int$>$ *cn = cp-$>$insert(3);\\

\vspace*{3mm}

const int i = cp-$>$info(cn);
\end{flushleft}

Regardless of the underlying representation, the information stored in a 
node is available.  When using linked container structures such as lists
or trees, it is sometimes useful to store {\em ContainerNode}
pointers for future quick reference without having to search for items.  
However, If
the underlying container is an array, there is no {\em ContainerNode}
structure.
	 \end{minipage}
\end{minipage}
\vspace{0.2in}


